./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/lamport.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/lamport.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:08:35,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:08:35,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:08:35,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:08:35,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:08:35,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:08:35,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:08:35,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:08:35,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:08:35,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:08:35,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:08:35,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:08:35,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:08:35,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:08:35,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:08:35,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:08:35,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:08:35,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:08:35,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:08:35,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:08:35,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:08:35,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:08:35,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:08:35,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:08:35,124 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:08:35,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:08:35,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:08:35,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:08:35,125 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:08:35,125 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:08:35,125 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:08:35,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:08:35,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:08:35,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:08:35,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:08:35,126 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:08:35,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:08:35,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:08:35,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:08:35,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:08:35,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:08:35,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:08:35,128 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b308ef82643f3d5bfbffb17cfcc4180faf3590c2e3fc7a25c3079a0f6ea799c [2024-11-10 10:08:35,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:08:35,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:08:35,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:08:35,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:08:35,355 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:08:35,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-10 10:08:36,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:08:36,741 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:08:36,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i [2024-11-10 10:08:36,759 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a4f97f3/584f18021ae54cedb319f70d413a56ba/FLAG25b83e45b [2024-11-10 10:08:36,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4a4f97f3/584f18021ae54cedb319f70d413a56ba [2024-11-10 10:08:36,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:08:36,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:08:36,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:08:36,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:08:36,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:08:36,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:36" (1/1) ... [2024-11-10 10:08:36,782 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2039085f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:36, skipping insertion in model container [2024-11-10 10:08:36,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:08:36" (1/1) ... [2024-11-10 10:08:36,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:08:37,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i[32541,32554] [2024-11-10 10:08:37,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i[32909,32922] [2024-11-10 10:08:37,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:08:37,124 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:08:37,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i[32541,32554] [2024-11-10 10:08:37,157 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/lamport.i[32909,32922] [2024-11-10 10:08:37,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:08:37,187 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:08:37,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37 WrapperNode [2024-11-10 10:08:37,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:08:37,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:08:37,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:08:37,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:08:37,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,222 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-11-10 10:08:37,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:08:37,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:08:37,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:08:37,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:08:37,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,241 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 10:08:37,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,250 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:08:37,258 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:08:37,259 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:08:37,259 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:08:37,259 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (1/1) ... [2024-11-10 10:08:37,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:08:37,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:08:37,281 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 10:08:37,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 10:08:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-10 10:08:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-10 10:08:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-10 10:08:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-10 10:08:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:08:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:08:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:08:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:08:37,316 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:08:37,405 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:08:37,406 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:08:37,540 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:08:37,540 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:08:37,596 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:08:37,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:08:37,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:08:37 BoogieIcfgContainer [2024-11-10 10:08:37,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:08:37,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:08:37,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:08:37,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:08:37,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:08:36" (1/3) ... [2024-11-10 10:08:37,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641bf22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:08:37, skipping insertion in model container [2024-11-10 10:08:37,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:08:37" (2/3) ... [2024-11-10 10:08:37,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641bf22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:08:37, skipping insertion in model container [2024-11-10 10:08:37,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:08:37" (3/3) ... [2024-11-10 10:08:37,603 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport.i [2024-11-10 10:08:37,615 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:08:37,615 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:08:37,616 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:08:37,653 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:08:37,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 84 transitions, 182 flow [2024-11-10 10:08:37,700 INFO L124 PetriNetUnfolderBase]: 24/82 cut-off events. [2024-11-10 10:08:37,700 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:08:37,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 82 events. 24/82 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 79. Up to 5 conditions per place. [2024-11-10 10:08:37,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 84 transitions, 182 flow [2024-11-10 10:08:37,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 80 transitions, 169 flow [2024-11-10 10:08:37,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:08:37,720 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6454dae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:08:37,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:08:37,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:08:37,726 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2024-11-10 10:08:37,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:08:37,726 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:37,727 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:37,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:08:37,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1791394724, now seen corresponding path program 1 times [2024-11-10 10:08:37,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872855436] [2024-11-10 10:08:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:37,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:37,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872855436] [2024-11-10 10:08:37,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872855436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:37,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:37,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:08:37,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943969834] [2024-11-10 10:08:37,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:37,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:08:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:37,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:08:37,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:08:37,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 84 [2024-11-10 10:08:37,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 80 transitions, 169 flow. Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:37,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:37,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 84 [2024-11-10 10:08:38,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:38,171 INFO L124 PetriNetUnfolderBase]: 441/1005 cut-off events. [2024-11-10 10:08:38,173 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-10 10:08:38,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1600 conditions, 1005 events. 441/1005 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6150 event pairs, 288 based on Foata normal form. 275/1112 useless extension candidates. Maximal degree in co-relation 1540. Up to 560 conditions per place. [2024-11-10 10:08:38,186 INFO L140 encePairwiseOnDemand]: 72/84 looper letters, 24 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2024-11-10 10:08:38,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 193 flow [2024-11-10 10:08:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:08:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:08:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2024-11-10 10:08:38,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7619047619047619 [2024-11-10 10:08:38,197 INFO L175 Difference]: Start difference. First operand has 63 places, 80 transitions, 169 flow. Second operand 2 states and 128 transitions. [2024-11-10 10:08:38,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 193 flow [2024-11-10 10:08:38,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:08:38,201 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 140 flow [2024-11-10 10:08:38,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2024-11-10 10:08:38,205 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, -2 predicate places. [2024-11-10 10:08:38,205 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 140 flow [2024-11-10 10:08:38,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:38,206 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:38,207 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:38,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:08:38,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:08:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash 216647266, now seen corresponding path program 1 times [2024-11-10 10:08:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005307918] [2024-11-10 10:08:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:38,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:38,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005307918] [2024-11-10 10:08:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005307918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:38,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:38,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:08:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813704403] [2024-11-10 10:08:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:38,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:08:38,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:38,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:08:38,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:08:38,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 84 [2024-11-10 10:08:38,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:38,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:38,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 84 [2024-11-10 10:08:38,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:38,422 INFO L124 PetriNetUnfolderBase]: 567/1224 cut-off events. [2024-11-10 10:08:38,423 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 10:08:38,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2041 conditions, 1224 events. 567/1224 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7342 event pairs, 206 based on Foata normal form. 26/1069 useless extension candidates. Maximal degree in co-relation 2038. Up to 465 conditions per place. [2024-11-10 10:08:38,429 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 36 selfloop transitions, 3 changer transitions 3/83 dead transitions. [2024-11-10 10:08:38,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 255 flow [2024-11-10 10:08:38,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:08:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:08:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2024-11-10 10:08:38,431 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6865079365079365 [2024-11-10 10:08:38,431 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 140 flow. Second operand 3 states and 173 transitions. [2024-11-10 10:08:38,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 255 flow [2024-11-10 10:08:38,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 255 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:08:38,435 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 160 flow [2024-11-10 10:08:38,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2024-11-10 10:08:38,436 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 2 predicate places. [2024-11-10 10:08:38,436 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 160 flow [2024-11-10 10:08:38,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:38,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:38,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:38,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:08:38,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:08:38,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash 17592255, now seen corresponding path program 1 times [2024-11-10 10:08:38,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:38,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648114099] [2024-11-10 10:08:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:38,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:38,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648114099] [2024-11-10 10:08:38,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648114099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:38,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:38,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:08:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863559069] [2024-11-10 10:08:38,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:38,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:08:38,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:38,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:08:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:08:38,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 84 [2024-11-10 10:08:38,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:38,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:38,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 84 [2024-11-10 10:08:38,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:38,660 INFO L124 PetriNetUnfolderBase]: 532/1148 cut-off events. [2024-11-10 10:08:38,660 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-10 10:08:38,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 1148 events. 532/1148 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6660 event pairs, 237 based on Foata normal form. 33/1032 useless extension candidates. Maximal degree in co-relation 2044. Up to 524 conditions per place. [2024-11-10 10:08:38,666 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 32 selfloop transitions, 2 changer transitions 7/82 dead transitions. [2024-11-10 10:08:38,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 82 transitions, 269 flow [2024-11-10 10:08:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:08:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:08:38,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2024-11-10 10:08:38,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2024-11-10 10:08:38,669 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 160 flow. Second operand 3 states and 172 transitions. [2024-11-10 10:08:38,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 82 transitions, 269 flow [2024-11-10 10:08:38,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:38,674 INFO L231 Difference]: Finished difference. Result has 66 places, 69 transitions, 164 flow [2024-11-10 10:08:38,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2024-11-10 10:08:38,674 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2024-11-10 10:08:38,675 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 69 transitions, 164 flow [2024-11-10 10:08:38,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:38,676 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:38,676 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:38,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:08:38,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:08:38,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1671306115, now seen corresponding path program 1 times [2024-11-10 10:08:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:38,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549129349] [2024-11-10 10:08:38,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:38,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:38,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549129349] [2024-11-10 10:08:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549129349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:38,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:08:38,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531590038] [2024-11-10 10:08:38,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:38,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:08:38,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:38,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:08:38,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:08:38,762 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 84 [2024-11-10 10:08:38,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 69 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:38,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:38,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 84 [2024-11-10 10:08:38,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:38,880 INFO L124 PetriNetUnfolderBase]: 785/1663 cut-off events. [2024-11-10 10:08:38,881 INFO L125 PetriNetUnfolderBase]: For 133/147 co-relation queries the response was YES. [2024-11-10 10:08:38,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 1663 events. 785/1663 cut-off events. For 133/147 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10250 event pairs, 385 based on Foata normal form. 28/1544 useless extension candidates. Maximal degree in co-relation 2999. Up to 936 conditions per place. [2024-11-10 10:08:38,887 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 42 selfloop transitions, 5 changer transitions 2/85 dead transitions. [2024-11-10 10:08:38,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 85 transitions, 300 flow [2024-11-10 10:08:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:08:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:08:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2024-11-10 10:08:38,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2024-11-10 10:08:38,889 INFO L175 Difference]: Start difference. First operand has 66 places, 69 transitions, 164 flow. Second operand 3 states and 165 transitions. [2024-11-10 10:08:38,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 85 transitions, 300 flow [2024-11-10 10:08:38,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:08:38,894 INFO L231 Difference]: Finished difference. Result has 69 places, 73 transitions, 208 flow [2024-11-10 10:08:38,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2024-11-10 10:08:38,895 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 6 predicate places. [2024-11-10 10:08:38,896 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 208 flow [2024-11-10 10:08:38,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:38,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:38,897 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:38,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:08:38,897 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:08:38,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash 555901005, now seen corresponding path program 2 times [2024-11-10 10:08:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:38,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562443252] [2024-11-10 10:08:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:38,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:38,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562443252] [2024-11-10 10:08:38,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562443252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:38,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:38,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:08:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788838000] [2024-11-10 10:08:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:38,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:08:38,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:08:38,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:08:38,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 84 [2024-11-10 10:08:38,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:38,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:38,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 84 [2024-11-10 10:08:38,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:39,114 INFO L124 PetriNetUnfolderBase]: 1151/2654 cut-off events. [2024-11-10 10:08:39,114 INFO L125 PetriNetUnfolderBase]: For 696/768 co-relation queries the response was YES. [2024-11-10 10:08:39,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 2654 events. 1151/2654 cut-off events. For 696/768 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 19555 event pairs, 371 based on Foata normal form. 67/2511 useless extension candidates. Maximal degree in co-relation 5213. Up to 845 conditions per place. [2024-11-10 10:08:39,124 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 50 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2024-11-10 10:08:39,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 387 flow [2024-11-10 10:08:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:08:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:08:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2024-11-10 10:08:39,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7063492063492064 [2024-11-10 10:08:39,125 INFO L175 Difference]: Start difference. First operand has 69 places, 73 transitions, 208 flow. Second operand 3 states and 178 transitions. [2024-11-10 10:08:39,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 387 flow [2024-11-10 10:08:39,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:39,129 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 226 flow [2024-11-10 10:08:39,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2024-11-10 10:08:39,130 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 8 predicate places. [2024-11-10 10:08:39,130 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 226 flow [2024-11-10 10:08:39,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:39,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:39,130 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:39,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:08:39,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:08:39,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash 919706481, now seen corresponding path program 3 times [2024-11-10 10:08:39,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:39,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424619742] [2024-11-10 10:08:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:39,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:39,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:39,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424619742] [2024-11-10 10:08:39,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424619742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:39,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:39,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:08:39,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386802847] [2024-11-10 10:08:39,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:39,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:08:39,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:39,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:08:39,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:08:39,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 84 [2024-11-10 10:08:39,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:39,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:39,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 84 [2024-11-10 10:08:39,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:39,364 INFO L124 PetriNetUnfolderBase]: 1199/2602 cut-off events. [2024-11-10 10:08:39,364 INFO L125 PetriNetUnfolderBase]: For 730/818 co-relation queries the response was YES. [2024-11-10 10:08:39,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5583 conditions, 2602 events. 1199/2602 cut-off events. For 730/818 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18653 event pairs, 641 based on Foata normal form. 113/2581 useless extension candidates. Maximal degree in co-relation 5575. Up to 1570 conditions per place. [2024-11-10 10:08:39,372 INFO L140 encePairwiseOnDemand]: 74/84 looper letters, 41 selfloop transitions, 5 changer transitions 9/92 dead transitions. [2024-11-10 10:08:39,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 92 transitions, 387 flow [2024-11-10 10:08:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:08:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:08:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2024-11-10 10:08:39,374 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2024-11-10 10:08:39,374 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 226 flow. Second operand 3 states and 164 transitions. [2024-11-10 10:08:39,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 92 transitions, 387 flow [2024-11-10 10:08:39,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 92 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:39,377 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 244 flow [2024-11-10 10:08:39,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2024-11-10 10:08:39,379 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2024-11-10 10:08:39,380 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 244 flow [2024-11-10 10:08:39,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:39,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:39,380 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:39,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:08:39,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:08:39,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash -244623191, now seen corresponding path program 4 times [2024-11-10 10:08:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:39,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122376515] [2024-11-10 10:08:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:39,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:39,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:39,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122376515] [2024-11-10 10:08:39,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122376515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:39,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:39,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:08:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506852672] [2024-11-10 10:08:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:39,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:08:39,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:39,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:08:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:08:39,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 84 [2024-11-10 10:08:39,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:39,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:39,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 84 [2024-11-10 10:08:39,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:39,567 INFO L124 PetriNetUnfolderBase]: 886/2197 cut-off events. [2024-11-10 10:08:39,567 INFO L125 PetriNetUnfolderBase]: For 1183/1304 co-relation queries the response was YES. [2024-11-10 10:08:39,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 2197 events. 886/2197 cut-off events. For 1183/1304 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 16369 event pairs, 351 based on Foata normal form. 106/2213 useless extension candidates. Maximal degree in co-relation 4912. Up to 733 conditions per place. [2024-11-10 10:08:39,575 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 54 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2024-11-10 10:08:39,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 451 flow [2024-11-10 10:08:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:08:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:08:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2024-11-10 10:08:39,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7063492063492064 [2024-11-10 10:08:39,577 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 244 flow. Second operand 3 states and 178 transitions. [2024-11-10 10:08:39,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 451 flow [2024-11-10 10:08:39,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 431 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:39,580 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 256 flow [2024-11-10 10:08:39,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2024-11-10 10:08:39,582 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 12 predicate places. [2024-11-10 10:08:39,602 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 256 flow [2024-11-10 10:08:39,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:39,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:39,603 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:39,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:08:39,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:08:39,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1040019796, now seen corresponding path program 1 times [2024-11-10 10:08:39,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:39,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182433106] [2024-11-10 10:08:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:39,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:39,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:39,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182433106] [2024-11-10 10:08:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182433106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:39,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:08:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012401804] [2024-11-10 10:08:39,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:39,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:08:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:39,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:08:39,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:08:39,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 84 [2024-11-10 10:08:39,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:39,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:39,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 84 [2024-11-10 10:08:39,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:39,782 INFO L124 PetriNetUnfolderBase]: 696/1667 cut-off events. [2024-11-10 10:08:39,782 INFO L125 PetriNetUnfolderBase]: For 759/844 co-relation queries the response was YES. [2024-11-10 10:08:39,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3754 conditions, 1667 events. 696/1667 cut-off events. For 759/844 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 11422 event pairs, 284 based on Foata normal form. 30/1602 useless extension candidates. Maximal degree in co-relation 3744. Up to 708 conditions per place. [2024-11-10 10:08:39,788 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 42 selfloop transitions, 4 changer transitions 13/92 dead transitions. [2024-11-10 10:08:39,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 427 flow [2024-11-10 10:08:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:08:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:08:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2024-11-10 10:08:39,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6865079365079365 [2024-11-10 10:08:39,790 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 256 flow. Second operand 3 states and 173 transitions. [2024-11-10 10:08:39,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 427 flow [2024-11-10 10:08:39,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 407 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:39,793 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 234 flow [2024-11-10 10:08:39,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2024-11-10 10:08:39,794 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 13 predicate places. [2024-11-10 10:08:39,795 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 234 flow [2024-11-10 10:08:39,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:39,795 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:08:39,795 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:08:39,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:08:39,795 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:08:39,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:08:39,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2090005208, now seen corresponding path program 1 times [2024-11-10 10:08:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:08:39,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511977550] [2024-11-10 10:08:39,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:08:39,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:08:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:08:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:08:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:08:39,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511977550] [2024-11-10 10:08:39,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511977550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:08:39,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:08:39,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:08:39,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334495191] [2024-11-10 10:08:39,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:08:39,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:08:39,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:08:39,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:08:39,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:08:39,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 84 [2024-11-10 10:08:39,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:39,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:08:39,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 84 [2024-11-10 10:08:39,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:08:39,929 INFO L124 PetriNetUnfolderBase]: 575/1367 cut-off events. [2024-11-10 10:08:39,929 INFO L125 PetriNetUnfolderBase]: For 692/758 co-relation queries the response was YES. [2024-11-10 10:08:39,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3299 conditions, 1367 events. 575/1367 cut-off events. For 692/758 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8806 event pairs, 206 based on Foata normal form. 28/1343 useless extension candidates. Maximal degree in co-relation 3288. Up to 496 conditions per place. [2024-11-10 10:08:39,933 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 0 selfloop transitions, 0 changer transitions 78/78 dead transitions. [2024-11-10 10:08:39,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 388 flow [2024-11-10 10:08:39,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:08:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:08:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2024-11-10 10:08:39,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2024-11-10 10:08:39,935 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 234 flow. Second operand 3 states and 170 transitions. [2024-11-10 10:08:39,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 388 flow [2024-11-10 10:08:39,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 374 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 10:08:39,937 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2024-11-10 10:08:39,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2024-11-10 10:08:39,939 INFO L277 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2024-11-10 10:08:39,939 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2024-11-10 10:08:39,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:08:39,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-10 10:08:39,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-10 10:08:39,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-10 10:08:39,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-10 10:08:39,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-11-10 10:08:39,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-10 10:08:39,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:08:39,944 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-10 10:08:39,948 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:08:39,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:08:39,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:08:39 BasicIcfg [2024-11-10 10:08:39,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:08:39,952 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:08:39,952 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:08:39,952 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:08:39,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:08:37" (3/4) ... [2024-11-10 10:08:39,954 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 10:08:39,956 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-11-10 10:08:39,956 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-11-10 10:08:39,958 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2024-11-10 10:08:39,958 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-10 10:08:39,958 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 10:08:39,958 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 10:08:40,014 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:08:40,015 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 10:08:40,015 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:08:40,016 INFO L158 Benchmark]: Toolchain (without parser) took 3240.10ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 68.0MB in the beginning and 96.0MB in the end (delta: -28.0MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2024-11-10 10:08:40,016 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 138.4MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:08:40,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.10ms. Allocated memory is still 138.4MB. Free memory was 67.8MB in the beginning and 93.0MB in the end (delta: -25.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-10 10:08:40,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.32ms. Allocated memory is still 138.4MB. Free memory was 93.0MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:08:40,017 INFO L158 Benchmark]: Boogie Preprocessor took 31.77ms. Allocated memory is still 138.4MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:08:40,017 INFO L158 Benchmark]: IcfgBuilder took 338.05ms. Allocated memory is still 138.4MB. Free memory was 89.3MB in the beginning and 69.6MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 10:08:40,018 INFO L158 Benchmark]: TraceAbstraction took 2353.76ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 68.8MB in the beginning and 100.2MB in the end (delta: -31.4MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2024-11-10 10:08:40,018 INFO L158 Benchmark]: Witness Printer took 63.06ms. Allocated memory is still 255.9MB. Free memory was 100.2MB in the beginning and 96.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:08:40,019 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 138.4MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.10ms. Allocated memory is still 138.4MB. Free memory was 67.8MB in the beginning and 93.0MB in the end (delta: -25.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.32ms. Allocated memory is still 138.4MB. Free memory was 93.0MB in the beginning and 91.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.77ms. Allocated memory is still 138.4MB. Free memory was 91.0MB in the beginning and 89.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 338.05ms. Allocated memory is still 138.4MB. Free memory was 89.3MB in the beginning and 69.6MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2353.76ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 68.8MB in the beginning and 100.2MB in the end (delta: -31.4MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. * Witness Printer took 63.06ms. Allocated memory is still 255.9MB. Free memory was 100.2MB in the beginning and 96.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 781]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 755]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 542 IncrementalHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 18 mSDtfsCounter, 542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=7, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 10:08:40,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE