/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/peterson.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:58:08,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:58:08,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:58:08,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:58:08,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:58:08,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:58:08,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:58:08,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:58:08,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:58:08,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:58:08,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:58:08,315 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:58:08,315 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:58:08,316 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:58:08,316 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:58:08,316 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:58:08,316 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:58:08,316 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:58:08,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:58:08,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:58:08,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:58:08,318 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:58:08,318 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:58:08,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:58:08,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:58:08,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:58:08,319 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:58:08,319 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:58:08,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:58:08,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:58:08,320 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:58:08,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:58:08,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:58:08,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:58:08,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:58:08,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:58:08,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:58:08,321 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:58:08,322 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-09 23:58:08,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:58:08,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:58:08,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:58:08,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-09 23:58:08,580 INFO L274 PluginConnector]: CDTParser initialized [2024-02-09 23:58:08,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson.i [2024-02-09 23:58:09,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-09 23:58:09,830 INFO L384 CDTParser]: Found 1 translation units. [2024-02-09 23:58:09,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i [2024-02-09 23:58:09,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cec8056c/d8db7a284f3649d79cd3d29dab017d8a/FLAG0220dc8e9 [2024-02-09 23:58:09,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cec8056c/d8db7a284f3649d79cd3d29dab017d8a [2024-02-09 23:58:09,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:58:09,857 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-09 23:58:09,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-09 23:58:09,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-09 23:58:09,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-09 23:58:09,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:58:09" (1/1) ... [2024-02-09 23:58:09,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a44172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:09, skipping insertion in model container [2024-02-09 23:58:09,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:58:09" (1/1) ... [2024-02-09 23:58:09,914 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-09 23:58:10,026 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-09 23:58:10,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:58:10,112 INFO L202 MainTranslator]: Completed pre-run [2024-02-09 23:58:10,135 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-09 23:58:10,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:58:10,193 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:58:10,193 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:58:10,193 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:58:10,199 INFO L206 MainTranslator]: Completed translation [2024-02-09 23:58:10,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10 WrapperNode [2024-02-09 23:58:10,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-09 23:58:10,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:58:10,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:58:10,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:58:10,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,247 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2024-02-09 23:58:10,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:58:10,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:58:10,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:58:10,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:58:10,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:58:10,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:58:10,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:58:10,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:58:10,278 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (1/1) ... [2024-02-09 23:58:10,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:58:10,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:58:10,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:58:10,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:58:10,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-09 23:58:10,345 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-02-09 23:58:10,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-02-09 23:58:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-09 23:58:10,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-09 23:58:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-09 23:58:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-09 23:58:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-09 23:58:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-09 23:58:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-09 23:58:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-09 23:58:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-09 23:58:10,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:58:10,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:58:10,347 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:58:10,431 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:58:10,433 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:58:10,592 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:58:10,597 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:58:10,597 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-09 23:58:10,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:58:10 BoogieIcfgContainer [2024-02-09 23:58:10,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:58:10,599 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:58:10,599 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:58:10,602 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:58:10,602 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:58:10,603 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.02 11:58:09" (1/3) ... [2024-02-09 23:58:10,603 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61368a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:58:10, skipping insertion in model container [2024-02-09 23:58:10,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:58:10,603 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:58:10" (2/3) ... [2024-02-09 23:58:10,604 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61368a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:58:10, skipping insertion in model container [2024-02-09 23:58:10,612 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:58:10,612 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:58:10" (3/3) ... [2024-02-09 23:58:10,613 INFO L332 chiAutomizerObserver]: Analyzing ICFG peterson.i [2024-02-09 23:58:10,700 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:58:10,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 190 flow [2024-02-09 23:58:10,764 INFO L124 PetriNetUnfolderBase]: 8/84 cut-off events. [2024-02-09 23:58:10,764 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:58:10,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 8/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 102 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2024-02-09 23:58:10,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 88 transitions, 190 flow [2024-02-09 23:58:10,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 84 transitions, 180 flow [2024-02-09 23:58:10,781 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:58:10,781 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:58:10,781 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:58:10,781 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:58:10,781 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:58:10,781 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:58:10,781 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:58:10,781 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:58:10,782 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:10,783 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 83 places, 84 transitions, 180 flow [2024-02-09 23:58:10,848 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1643 states, 1642 states have (on average 2.937880633373934) internal successors, (4824), 1642 states have internal predecessors, (4824), 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-02-09 23:58:10,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1643 states, 1642 states have (on average 2.937880633373934) internal successors, (4824), 1642 states have internal predecessors, (4824), 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-02-09 23:58:10,951 INFO L131 ngComponentsAnalysis]: Automaton has 141 accepting balls. 447 [2024-02-09 23:58:10,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:10,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:10,957 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:58:10,957 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:10,957 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 83 places, 84 transitions, 180 flow [2024-02-09 23:58:10,979 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1643 states, 1642 states have (on average 2.937880633373934) internal successors, (4824), 1642 states have internal predecessors, (4824), 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-02-09 23:58:10,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1643 states, 1642 states have (on average 2.937880633373934) internal successors, (4824), 1642 states have internal predecessors, (4824), 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-02-09 23:58:10,995 INFO L131 ngComponentsAnalysis]: Automaton has 141 accepting balls. 447 [2024-02-09 23:58:10,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:10,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:11,000 INFO L748 eck$LassoCheckResult]: Stem: Black: 3376#[$Ultimate##0]don't care [147] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 3379#[L-1]don't care [164] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 3381#[L12]don't care [134] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 3383#[L12-1]don't care [155] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 3385#[L12-2]don't care [153] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 3387#[L12-3]don't care [178] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 3389#[L12-4]don't care [172] L12-4-->L700: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0] 3391#[L700]don't care [190] L700-->L701: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0] 3393#[L701]don't care [181] L701-->L702: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0] 3395#[L702]don't care [142] L702-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 3397#[L-1-1]don't care [189] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 3399#[L-1-2]don't care [192] L-1-2-->L760: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_1|, ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_1|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre4#1] 3401#[L760]don't care [180] L760-->L760-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t1~1#1.base, #valid, #length] 3403#[L760-1]don't care [162] L760-1-->L760-2: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 1)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~1#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_2|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, #valid, #length] 3405#[L760-2]don't care [175] L760-2-->L761: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 3407#[L761]don't care [144] L761-->L761-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 3409#[L761-1]don't care [173] L761-1-->L761-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~1#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~1#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) |v_ULTIMATE.start_main_~#t1~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] 3411#[L761-2]don't care [252] L761-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_4|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_4|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_10|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_4|, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_10|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_#in~_#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~f21~0#1, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_~_#1.base, thr1Thread1of1ForFork0_~t1~0#1, thr1Thread1of1ForFork0_#in~_#1.offset, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base] 3413#[$Ultimate##0, L761-3]don't care [228] $Ultimate##0-->L704: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.base_1| |v_thr1Thread1of1ForFork0_~_#1.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_1| |v_thr1Thread1of1ForFork0_~_#1.offset_1|)) InVars {thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_1|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_~_#1.base] 3417#[L704, L761-3]don't care [229] L704-->L706: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0] 3423#[L706, L761-3]don't care [230] L706-->L709: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0] 3431#[L709, L761-3]don't care [231] L709-->L712: Formula: (= |v_thr1Thread1of1ForFork0_~f21~0#1_1| v_~flag2~0_3) InVars {~flag2~0=v_~flag2~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_1|, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0#1] 3441#[L712, L761-3]don't care [232] L712-->L722: Formula: (= |v_thr1Thread1of1ForFork0_~t1~0#1_1| v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0#1] 3453#[L722, L761-3]don't care [2024-02-09 23:58:11,001 INFO L750 eck$LassoCheckResult]: Loop: 3453#[L722, L761-3]don't care [233] L722-->L717: Formula: (and (= |v_thr1Thread1of1ForFork0_~t1~0#1_3| 1) (= |v_thr1Thread1of1ForFork0_~f21~0#1_3| 1)) InVars {thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_3|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_3|} OutVars{thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_3|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_3|} AuxVars[] AssignedVars[] 3467#[L717, L761-3]don't care [236] L717-->L719: Formula: (= |v_thr1Thread1of1ForFork0_~f21~0#1_7| v_~flag2~0_4) InVars {~flag2~0=v_~flag2~0_4} OutVars{thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_7|, ~flag2~0=v_~flag2~0_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0#1] 3489#[L719, L761-3]don't care [238] L719-->L722: Formula: (= |v_thr1Thread1of1ForFork0_~t1~0#1_7| v_~turn~0_6) InVars {~turn~0=v_~turn~0_6} OutVars{~turn~0=v_~turn~0_6, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_7|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0#1] 3453#[L722, L761-3]don't care [2024-02-09 23:58:11,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:11,005 INFO L85 PathProgramCache]: Analyzing trace with hash 138993370, now seen corresponding path program 1 times [2024-02-09 23:58:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:11,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84075105] [2024-02-09 23:58:11,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:11,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:11,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:11,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:11,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash 261258, now seen corresponding path program 1 times [2024-02-09 23:58:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:11,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455315743] [2024-02-09 23:58:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:11,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:11,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:11,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:11,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:11,180 INFO L85 PathProgramCache]: Analyzing trace with hash 403243793, now seen corresponding path program 1 times [2024-02-09 23:58:11,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:11,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130775190] [2024-02-09 23:58:11,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:11,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:58:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:58:11,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:58:11,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130775190] [2024-02-09 23:58:11,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130775190] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:58:11,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:58:11,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:58:11,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900949523] [2024-02-09 23:58:11,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:58:11,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:58:11,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-09 23:58:11,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-09 23:58:11,566 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 180 flow. Second operand 5 states and 440 transitions. [2024-02-09 23:58:11,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 180 flow. Second operand 5 states and 440 transitions. [2024-02-09 23:58:11,572 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 88 [2024-02-09 23:58:11,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-09 23:58:11,599 INFO L124 PetriNetUnfolderBase]: 6/140 cut-off events. [2024-02-09 23:58:11,600 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-09 23:58:11,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 140 events. 6/140 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 396 event pairs, 0 based on Foata normal form. 25/156 useless extension candidates. Maximal degree in co-relation 112. Up to 7 conditions per place. [2024-02-09 23:58:11,602 INFO L140 encePairwiseOnDemand]: 76/88 looper letters, 5 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2024-02-09 23:58:11,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 194 flow [2024-02-09 23:58:11,603 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 201 flow [2024-02-09 23:58:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-09 23:58:11,607 INFO L428 stractBuchiCegarLoop]: Abstraction has has 90 places, 78 transitions, 201 flow [2024-02-09 23:58:11,607 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:58:11,607 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:11,607 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 90 places, 78 transitions, 201 flow [2024-02-09 23:58:11,645 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2036 states, 2028 states have (on average 2.6208086785009863) internal successors, (5315), 2035 states have internal predecessors, (5315), 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-02-09 23:58:11,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2036 states, 2028 states have (on average 2.6208086785009863) internal successors, (5315), 2035 states have internal predecessors, (5315), 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-02-09 23:58:11,661 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 462 [2024-02-09 23:58:11,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:11,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:11,663 INFO L748 eck$LassoCheckResult]: Stem: Black: 6678#[$Ultimate##0]don't care [147] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 6681#[L-1]don't care [164] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 6683#[L12]don't care [134] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 6685#[L12-1]don't care [155] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 6687#[L12-2]don't care [153] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 6689#[L12-3]don't care [178] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 6691#[L12-4]don't care [172] L12-4-->L700: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0] 6693#[L700]don't care [190] L700-->L701: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0] 6695#[L701]don't care [181] L701-->L702: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0] 6697#[L702]don't care [142] L702-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 6699#[L-1-1]don't care [189] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 6701#[L-1-2]don't care [192] L-1-2-->L760: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_1|, ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_1|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre4#1] 6703#[L760]don't care [180] L760-->L760-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t1~1#1.base, #valid, #length] 6705#[L760-1]don't care [162] L760-1-->L760-2: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 1)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~1#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_2|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, #valid, #length] 6707#[L760-2]don't care [175] L760-2-->L761: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 6709#[L761]don't care [144] L761-->L761-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 6711#[L761-1]don't care [173] L761-1-->L761-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~1#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~1#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) |v_ULTIMATE.start_main_~#t1~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] 6713#[L761-2]don't care [252] L761-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_4|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_4|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_10|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_4|, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_10|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_#in~_#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~f21~0#1, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_~_#1.base, thr1Thread1of1ForFork0_~t1~0#1, thr1Thread1of1ForFork0_#in~_#1.offset, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base] 6715#[L761-3, $Ultimate##0]don't care [201] L761-3-->L761-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 6719#[L761-4, $Ultimate##0]don't care [165] L761-4-->L762: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 6725#[L762, $Ultimate##0]don't care [140] L762-->L762-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 6733#[L762-1, $Ultimate##0]don't care [152] L762-1-->L762-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 6743#[L762-2, $Ultimate##0]don't care [132] L762-2-->L762-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~1#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~1#1.base_3|) |v_ULTIMATE.start_main_~#t2~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_main_~#t2~1#1.offset_3| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t2~1#1.offset_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~1#1.base_3|) 1)) InVars {ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_3|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_3|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 6755#[L762-3, $Ultimate##0]don't care [255] L762-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork1_thidvar0_2) (= |v_thr2Thread1of1ForFork1_#in~_#1.base_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_thr2Thread1of1ForFork1_#in~_#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_4|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_10|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_4|, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_10|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_4|, thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork1_~f12~0#1, thr2Thread1of1ForFork1_#in~_#1.offset, thr2Thread1of1ForFork1_~t2~0#1, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_#in~_#1.base, thr2Thread1of1ForFork1_~_#1.offset, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork1_#res#1.base] 6769#[L762-4, $Ultimate##0, $Ultimate##0]don't care [206] $Ultimate##0-->L732: Formula: (and (= |v_thr2Thread1of1ForFork1_~_#1.base_1| |v_thr2Thread1of1ForFork1_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork1_~_#1.offset_1| |v_thr2Thread1of1ForFork1_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_1|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_1|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_~_#1.offset] 6787#[L732, L762-4, $Ultimate##0]don't care [207] L732-->L734: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 6813#[L734, $Ultimate##0, L762-4]don't care [208] L734-->L737: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] 6849#[L737, $Ultimate##0, L762-4]don't care [209] L737-->L740: Formula: (= v_~flag1~0_1 |v_thr2Thread1of1ForFork1_~f12~0#1_1|) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0#1] 6895#[L740, $Ultimate##0, L762-4]don't care [210] L740-->L750: Formula: (= |v_thr2Thread1of1ForFork1_~t2~0#1_1| v_~turn~0_2) InVars {~turn~0=v_~turn~0_2} OutVars{~turn~0=v_~turn~0_2, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0#1] 6949#[L750, $Ultimate##0, L762-4]don't care [2024-02-09 23:58:11,663 INFO L750 eck$LassoCheckResult]: Loop: 6949#[L750, $Ultimate##0, L762-4]don't care [211] L750-->L745: Formula: (and (= |v_thr2Thread1of1ForFork1_~t2~0#1_3| 0) (= |v_thr2Thread1of1ForFork1_~f12~0#1_3| 1)) InVars {thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_3|, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_3|} OutVars{thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_3|, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_3|} AuxVars[] AssignedVars[] 7011#[L745, $Ultimate##0, L762-4]don't care [214] L745-->L747: Formula: (= v_~flag1~0_2 |v_thr2Thread1of1ForFork1_~f12~0#1_7|) InVars {~flag1~0=v_~flag1~0_2} OutVars{~flag1~0=v_~flag1~0_2, thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_7|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0#1] 7089#[L747, $Ultimate##0, L762-4]don't care [216] L747-->L750: Formula: (= |v_thr2Thread1of1ForFork1_~t2~0#1_7| v_~turn~0_3) InVars {~turn~0=v_~turn~0_3} OutVars{~turn~0=v_~turn~0_3, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_7|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0#1] 6949#[L750, $Ultimate##0, L762-4]don't care [2024-02-09 23:58:11,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2053202783, now seen corresponding path program 1 times [2024-02-09 23:58:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:11,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87317856] [2024-02-09 23:58:11,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:11,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:11,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:11,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash 239412, now seen corresponding path program 1 times [2024-02-09 23:58:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153571987] [2024-02-09 23:58:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:11,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:11,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:11,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1960330900, now seen corresponding path program 1 times [2024-02-09 23:58:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469358034] [2024-02-09 23:58:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:58:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:58:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-09 23:58:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469358034] [2024-02-09 23:58:11,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469358034] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-09 23:58:11,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-09 23:58:11,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-09 23:58:11,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445839959] [2024-02-09 23:58:11,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-09 23:58:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-09 23:58:11,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-09 23:58:11,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-09 23:58:11,906 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 201 flow. Second operand 5 states and 440 transitions. [2024-02-09 23:58:11,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 201 flow. Second operand 5 states and 440 transitions. [2024-02-09 23:58:11,908 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 88 [2024-02-09 23:58:11,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-09 23:58:11,951 INFO L124 PetriNetUnfolderBase]: 15/272 cut-off events. [2024-02-09 23:58:11,951 INFO L125 PetriNetUnfolderBase]: For 34/36 co-relation queries the response was YES. [2024-02-09 23:58:11,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 272 events. 15/272 cut-off events. For 34/36 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1358 event pairs, 0 based on Foata normal form. 4/259 useless extension candidates. Maximal degree in co-relation 259. Up to 15 conditions per place. [2024-02-09 23:58:11,955 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 6 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2024-02-09 23:58:11,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 84 transitions, 242 flow [2024-02-09 23:58:11,957 INFO L231 Difference]: Finished difference. Result has 97 places, 82 transitions, 242 flow [2024-02-09 23:58:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-09 23:58:11,958 INFO L428 stractBuchiCegarLoop]: Abstraction has has 97 places, 82 transitions, 242 flow [2024-02-09 23:58:11,958 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:58:11,958 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-09 23:58:11,958 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 97 places, 82 transitions, 242 flow [2024-02-09 23:58:12,032 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 3036 states, 3021 states have (on average 2.582588546838795) internal successors, (7802), 3035 states have internal predecessors, (7802), 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-02-09 23:58:12,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3036 states, 3021 states have (on average 2.582588546838795) internal successors, (7802), 3035 states have internal predecessors, (7802), 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-02-09 23:58:12,067 INFO L131 ngComponentsAnalysis]: Automaton has 140 accepting balls. 444 [2024-02-09 23:58:12,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:58:12,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:58:12,069 INFO L748 eck$LassoCheckResult]: Stem: Black: 10766#[$Ultimate##0]don't care [147] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 10769#[L-1]don't care [164] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 10771#[L12]don't care [134] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 10773#[L12-1]don't care [155] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 10775#[L12-2]don't care [153] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 10777#[L12-3]don't care [178] L12-3-->L12-4: Formula: (and (= (select |v_#length_2| 2) 11) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 10779#[L12-4]don't care [172] L12-4-->L700: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0] 10781#[L700]don't care [190] L700-->L701: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0] 10783#[L701]don't care [181] L701-->L702: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0] 10785#[L702]don't care [142] L702-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 10787#[L-1-1]don't care [189] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 10789#[L-1-2]don't care [192] L-1-2-->L760: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_1|, ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_1|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_#t~pre4#1] 10791#[L760]don't care [180] L760-->L760-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 4) |v_#length_3|) (= |v_ULTIMATE.start_main_~#t1~1#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~1#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t1~1#1.base, #valid, #length] 10793#[L760-1]don't care [162] L760-1-->L760-2: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 1)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~1#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) (= |v_ULTIMATE.start_main_~#t2~1#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_2|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, #valid, #length] 10795#[L760-2]don't care [175] L760-2-->L761: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 10797#[L761]don't care [144] L761-->L761-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 10799#[L761-1]don't care [173] L761-1-->L761-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~1#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~1#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) |v_ULTIMATE.start_main_~#t1~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{ULTIMATE.start_main_~#t1~1#1.offset=|v_ULTIMATE.start_main_~#t1~1#1.offset_3|, ULTIMATE.start_main_~#t1~1#1.base=|v_ULTIMATE.start_main_~#t1~1#1.base_3|, #valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] 10801#[L761-2]don't care [252] L761-2-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_#1.base_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_4|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_4|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_10|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr1Thread1of1ForFork0_#res#1.base=|v_thr1Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork0_#res#1.offset=|v_thr1Thread1of1ForFork0_#res#1.offset_4|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_4|, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_10|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_#in~_#1.base, thr1Thread1of1ForFork0_#res#1.offset, thr1Thread1of1ForFork0_~f21~0#1, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork0_#res#1.base, thr1Thread1of1ForFork0_~_#1.base, thr1Thread1of1ForFork0_~t1~0#1, thr1Thread1of1ForFork0_#in~_#1.offset, thr1Thread1of1ForFork0_reach_error_#t~nondet0#1.base] 10803#[L761-3, $Ultimate##0]don't care [228] $Ultimate##0-->L704: Formula: (and (= |v_thr1Thread1of1ForFork0_#in~_#1.base_1| |v_thr1Thread1of1ForFork0_~_#1.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_#1.offset_1| |v_thr1Thread1of1ForFork0_~_#1.offset_1|)) InVars {thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr1Thread1of1ForFork0_~_#1.offset=|v_thr1Thread1of1ForFork0_~_#1.offset_1|, thr1Thread1of1ForFork0_#in~_#1.base=|v_thr1Thread1of1ForFork0_#in~_#1.base_1|, thr1Thread1of1ForFork0_~_#1.base=|v_thr1Thread1of1ForFork0_~_#1.base_1|, thr1Thread1of1ForFork0_#in~_#1.offset=|v_thr1Thread1of1ForFork0_#in~_#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_#1.offset, thr1Thread1of1ForFork0_~_#1.base] 10805#[L704, L761-3]don't care [229] L704-->L706: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0] 10809#[L706, L761-3]don't care [230] L706-->L709: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0] 10815#[L761-3, L709]don't care [201] L761-3-->L761-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] 10825#[L761-4, L709]don't care [165] L761-4-->L762: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 10837#[L762, L709]don't care [140] L762-->L762-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 10851#[L762-1, L709]don't care [152] L762-1-->L762-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 10867#[L762-2, L709]don't care [132] L762-2-->L762-3: Formula: (and (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~1#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~1#1.base_3|) |v_ULTIMATE.start_main_~#t2~1#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) (<= (+ |v_ULTIMATE.start_main_~#t2~1#1.offset_3| 4) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~1#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t2~1#1.offset_3|) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~1#1.base_3|) 1)) InVars {ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_3|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|} OutVars{ULTIMATE.start_main_~#t2~1#1.base=|v_ULTIMATE.start_main_~#t2~1#1.base_3|, ULTIMATE.start_main_~#t2~1#1.offset=|v_ULTIMATE.start_main_~#t2~1#1.offset_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 10889#[L762-3, L709]don't care [255] L762-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork1_thidvar0_2) (= |v_thr2Thread1of1ForFork1_#in~_#1.base_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_thr2Thread1of1ForFork1_#in~_#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork1_#res#1.offset=|v_thr2Thread1of1ForFork1_#res#1.offset_4|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork1_~f12~0#1=|v_thr2Thread1of1ForFork1_~f12~0#1_10|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_4|, thr2Thread1of1ForFork1_~t2~0#1=|v_thr2Thread1of1ForFork1_~t2~0#1_10|, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_4|, thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_4|, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork1_#res#1.base=|v_thr2Thread1of1ForFork1_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_#res#1.offset, thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork1_~f12~0#1, thr2Thread1of1ForFork1_#in~_#1.offset, thr2Thread1of1ForFork1_~t2~0#1, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_#in~_#1.base, thr2Thread1of1ForFork1_~_#1.offset, thr2Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork1_#res#1.base] 10919#[$Ultimate##0, L762-4, L709]don't care [206] $Ultimate##0-->L732: Formula: (and (= |v_thr2Thread1of1ForFork1_~_#1.base_1| |v_thr2Thread1of1ForFork1_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork1_~_#1.offset_1| |v_thr2Thread1of1ForFork1_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork1_~_#1.offset=|v_thr2Thread1of1ForFork1_~_#1.offset_1|, thr2Thread1of1ForFork1_~_#1.base=|v_thr2Thread1of1ForFork1_~_#1.base_1|, thr2Thread1of1ForFork1_#in~_#1.offset=|v_thr2Thread1of1ForFork1_#in~_#1.offset_1|, thr2Thread1of1ForFork1_#in~_#1.base=|v_thr2Thread1of1ForFork1_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_#1.base, thr2Thread1of1ForFork1_~_#1.offset] 10959#[L732, L762-4, L709]don't care [207] L732-->L734: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 11009#[L709, L762-4, L734]don't care [231] L709-->L712: Formula: (= |v_thr1Thread1of1ForFork0_~f21~0#1_1| v_~flag2~0_3) InVars {~flag2~0=v_~flag2~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_1|, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0#1] 11067#[L712, L762-4, L734]don't care [232] L712-->L722: Formula: (= |v_thr1Thread1of1ForFork0_~t1~0#1_1| v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0#1] 11141#[L722, L762-4, L734]don't care [2024-02-09 23:58:12,069 INFO L750 eck$LassoCheckResult]: Loop: 11141#[L722, L762-4, L734]don't care [233] L722-->L717: Formula: (and (= |v_thr1Thread1of1ForFork0_~t1~0#1_3| 1) (= |v_thr1Thread1of1ForFork0_~f21~0#1_3| 1)) InVars {thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_3|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_3|} OutVars{thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_3|, thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_3|} AuxVars[] AssignedVars[] 11231#[L717, L762-4, L734]don't care [236] L717-->L719: Formula: (= |v_thr1Thread1of1ForFork0_~f21~0#1_7| v_~flag2~0_4) InVars {~flag2~0=v_~flag2~0_4} OutVars{thr1Thread1of1ForFork0_~f21~0#1=|v_thr1Thread1of1ForFork0_~f21~0#1_7|, ~flag2~0=v_~flag2~0_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0#1] 11353#[L762-4, L719, L734]don't care [238] L719-->L722: Formula: (= |v_thr1Thread1of1ForFork0_~t1~0#1_7| v_~turn~0_6) InVars {~turn~0=v_~turn~0_6} OutVars{~turn~0=v_~turn~0_6, thr1Thread1of1ForFork0_~t1~0#1=|v_thr1Thread1of1ForFork0_~t1~0#1_7|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0#1] 11141#[L722, L762-4, L734]don't care [2024-02-09 23:58:12,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:12,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1815169954, now seen corresponding path program 1 times [2024-02-09 23:58:12,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:12,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003795755] [2024-02-09 23:58:12,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:12,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:12,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash 261258, now seen corresponding path program 2 times [2024-02-09 23:58:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:12,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588526542] [2024-02-09 23:58:12,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:12,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:58:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2089611507, now seen corresponding path program 1 times [2024-02-09 23:58:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:58:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048366838] [2024-02-09 23:58:12,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:58:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:58:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:58:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:58:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:58:12,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:58:12 BoogieIcfgContainer [2024-02-09 23:58:12,983 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:58:12,983 INFO L158 Benchmark]: Toolchain (without parser) took 3126.21ms. Allocated memory was 272.6MB in the beginning and 355.5MB in the end (delta: 82.8MB). Free memory was 238.4MB in the beginning and 251.7MB in the end (delta: -13.3MB). Peak memory consumption was 69.5MB. Max. memory is 8.0GB. [2024-02-09 23:58:12,984 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:58:12,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.89ms. Allocated memory is still 272.6MB. Free memory was 238.4MB in the beginning and 218.6MB in the end (delta: 19.8MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2024-02-09 23:58:12,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.72ms. Allocated memory is still 272.6MB. Free memory was 218.4MB in the beginning and 216.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:58:12,985 INFO L158 Benchmark]: Boogie Preprocessor took 28.11ms. Allocated memory is still 272.6MB. Free memory was 216.5MB in the beginning and 214.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:58:12,986 INFO L158 Benchmark]: RCFGBuilder took 321.85ms. Allocated memory is still 272.6MB. Free memory was 214.8MB in the beginning and 200.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-02-09 23:58:12,986 INFO L158 Benchmark]: BuchiAutomizer took 2383.56ms. Allocated memory was 272.6MB in the beginning and 355.5MB in the end (delta: 82.8MB). Free memory was 200.2MB in the beginning and 251.7MB in the end (delta: -51.5MB). Peak memory consumption was 30.7MB. Max. memory is 8.0GB. [2024-02-09 23:58:12,988 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 339.89ms. Allocated memory is still 272.6MB. Free memory was 238.4MB in the beginning and 218.6MB in the end (delta: 19.8MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.72ms. Allocated memory is still 272.6MB. Free memory was 218.4MB in the beginning and 216.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.11ms. Allocated memory is still 272.6MB. Free memory was 216.5MB in the beginning and 214.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 321.85ms. Allocated memory is still 272.6MB. Free memory was 214.8MB in the beginning and 200.6MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2383.56ms. Allocated memory was 272.6MB in the beginning and 355.5MB in the end (delta: 82.8MB). Free memory was 200.2MB in the beginning and 251.7MB in the end (delta: -51.5MB). Peak memory consumption was 30.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 242 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 433 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 433 mSDsluCounter, 1040 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 584 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 100 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 456 mSDtfsCounter, 100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 716]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L700] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L701] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L702] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L760] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={14732:0}, t2={14731:0}, turn=0, x=0] [L761] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=22307, t1={14732:0}, t2={14731:0}, turn=0, x=0] [L705] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L708] 1 turn = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=1, x=0] [L762] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=22308, t1={14732:0}, t2={14731:0}, turn=1, x=0] [L733] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] [L711] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, turn=1, x=0] [L714] 1 int t1 = turn; VAL [_={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, t1=1, turn=1, x=0] Loop: [L716] COND TRUE f21==1 && t1==1 [L718] f21 = flag2 [L721] t1 = turn End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 716]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L700] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L701] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L702] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L760] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={14732:0}, t2={14731:0}, turn=0, x=0] [L761] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=22307, t1={14732:0}, t2={14731:0}, turn=0, x=0] [L705] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L708] 1 turn = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=1, x=0] [L762] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=22308, t1={14732:0}, t2={14731:0}, turn=1, x=0] [L733] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] [L711] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, turn=1, x=0] [L714] 1 int t1 = turn; VAL [_={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, t1=1, turn=1, x=0] Loop: [L716] COND TRUE f21==1 && t1==1 [L718] f21 = flag2 [L721] t1 = turn End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-09 23:58:13,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...