/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs NONE -i ../../../trunk/examples/svcomp/pthread-atomic/peterson.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:15:37,182 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:15:37,264 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-17 11:15:37,294 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:15:37,295 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:15:37,296 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:15:37,297 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:15:37,297 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:15:37,298 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:15:37,301 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:15:37,302 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:15:37,302 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:15:37,302 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:15:37,303 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:15:37,304 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:15:37,304 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:15:37,304 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:15:37,305 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:15:37,305 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:15:37,305 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:15:37,305 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:15:37,306 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:15:37,306 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:15:37,306 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:15:37,306 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:15:37,306 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:15:37,307 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:15:37,307 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:15:37,307 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:15:37,307 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:15:37,308 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:15:37,308 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:15:37,309 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:15:37,309 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:15:37,310 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:15:37,310 INFO L137 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: Fairness type for concurrent programs -> NONE [2023-09-17 11:15:37,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:15:37,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:15:37,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:15:37,567 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:15:37,567 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:15:37,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/peterson.i [2023-09-17 11:15:38,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:15:38,997 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:15:38,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i [2023-09-17 11:15:39,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0851b4511/d447dc8836fb4601b2d468837579c2cd/FLAGa365433c2 [2023-09-17 11:15:39,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0851b4511/d447dc8836fb4601b2d468837579c2cd [2023-09-17 11:15:39,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:15:39,024 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:15:39,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:15:39,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:15:39,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:15:39,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47aa1ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39, skipping insertion in model container [2023-09-17 11:15:39,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:15:39,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:15:39,217 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-17 11:15:39,352 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[30997,31010] [2023-09-17 11:15:39,358 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[31682,31695] [2023-09-17 11:15:39,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:15:39,375 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:15:39,399 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-09-17 11:15:39,426 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[30997,31010] [2023-09-17 11:15:39,428 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/peterson.i[31682,31695] [2023-09-17 11:15:39,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:15:39,461 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:15:39,461 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:15:39,465 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:15:39,471 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:15:39,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39 WrapperNode [2023-09-17 11:15:39,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:15:39,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:15:39,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:15:39,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:15:39,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,506 INFO L138 Inliner]: procedures = 171, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 37 [2023-09-17 11:15:39,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:15:39,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:15:39,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:15:39,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:15:39,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:15:39,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:15:39,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:15:39,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:15:39,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (1/1) ... [2023-09-17 11:15:39,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:15:39,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:15:39,561 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) [2023-09-17 11:15:39,591 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 [2023-09-17 11:15:39,607 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-09-17 11:15:39,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-09-17 11:15:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-09-17 11:15:39,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-09-17 11:15:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:15:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 11:15:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:15:39,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:15:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:15:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:15:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 11:15:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:15:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:15:39,612 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 11:15:39,746 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:15:39,747 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:15:39,855 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:15:39,861 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:15:39,861 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-17 11:15:39,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:15:39 BoogieIcfgContainer [2023-09-17 11:15:39,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:15:39,864 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:15:39,864 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:15:39,868 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:15:39,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:15:39,869 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:15:39" (1/3) ... [2023-09-17 11:15:39,869 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16c4f77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:15:39, skipping insertion in model container [2023-09-17 11:15:39,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:15:39,870 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:15:39" (2/3) ... [2023-09-17 11:15:39,870 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16c4f77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:15:39, skipping insertion in model container [2023-09-17 11:15:39,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:15:39,870 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:15:39" (3/3) ... [2023-09-17 11:15:39,871 INFO L332 chiAutomizerObserver]: Analyzing ICFG peterson.i [2023-09-17 11:15:39,981 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:15:40,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 72 transitions, 154 flow [2023-09-17 11:15:40,032 INFO L124 PetriNetUnfolderBase]: 6/68 cut-off events. [2023-09-17 11:15:40,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:15:40,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 68 events. 6/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-09-17 11:15:40,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 72 transitions, 154 flow [2023-09-17 11:15:40,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 68 transitions, 142 flow [2023-09-17 11:15:40,053 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:15:40,053 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:15:40,053 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:15:40,053 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:15:40,053 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:15:40,053 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:15:40,054 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:15:40,054 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:15:40,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-09-17 11:15:40,285 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 828 [2023-09-17 11:15:40,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:15:40,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:15:40,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:15:40,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-09-17 11:15:40,293 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:15:40,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2358 states, but on-demand construction may add more states [2023-09-17 11:15:40,332 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 828 [2023-09-17 11:15:40,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:15:40,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:15:40,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:15:40,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-09-17 11:15:40,345 INFO L748 eck$LassoCheckResult]: Stem: 74#[$Ultimate##0]don't care [117] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 77#[L-1]don't care [132] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] 79#[L-1-1]don't care [155] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 81#[L12]don't care [109] L12-->L12-1: Formula: (and (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] 83#[L12-1]don't care [124] 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[] 85#[L12-2]don't care [122] 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[] 87#[L12-3]don't care [145] L12-3-->L12-4: Formula: (and (= (select |v_#valid_2| 2) 1) (= (select |v_#length_2| 2) 11)) InVars {#length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 89#[L12-4]don't care [139] L12-4-->L700: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0] 91#[L700]don't care [156] L700-->L701: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0] 93#[L701]don't care [148] L701-->L702: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0] 95#[L702]don't care [113] L702-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 97#[L-1-2]don't care [157] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 99#[L-1-3]don't care [159] L-1-3-->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~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~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~nondet5#1, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre4#1] 101#[L760]don't care [147] 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_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~1#1.base_2| 0)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 1) |v_#valid_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~1#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t1~1#1.base, #valid, #length] 103#[L760-1]don't care [131] L760-1-->L760-2: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 4) |v_#length_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) 0) (= (store |v_#valid_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 1) |v_#valid_5|) (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_6|} 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, #valid, #length] 105#[L760-2]don't care [142] 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] 107#[L761]don't care [114] L761-->L761-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 109#[L761-1]don't care [140] L761-1-->L761-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) 1) (<= (+ |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|) (= (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_7|, #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_7|, #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] 111#[L761-2]don't care [202] L761-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_10, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~t1~0, thr1Thread1of1ForFork0_~_.offset] 113#[$Ultimate##0, L761-3]don't care [183] $Ultimate##0-->L704: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset] 117#[L761-3, L704]don't care [184] L704-->L706: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0] 123#[L706, L761-3]don't care [185] L706-->L709: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0] 131#[L709, L761-3]don't care [186] L709-->L712: Formula: (= v_~flag2~0_3 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 141#[L712, L761-3]don't care [187] L712-->L722: Formula: (= v_thr1Thread1of1ForFork0_~t1~0_1 v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0] 153#[L761-3, L722]don't care [2023-09-17 11:15:40,349 INFO L750 eck$LassoCheckResult]: Loop: 153#[L761-3, L722]don't care [188] L722-->L717: Formula: (and (= v_thr1Thread1of1ForFork0_~f21~0_3 1) (= v_thr1Thread1of1ForFork0_~t1~0_3 1)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_3} AuxVars[] AssignedVars[] 167#[L717, L761-3]don't care [191] L717-->L719: Formula: (= v_~flag2~0_4 v_thr1Thread1of1ForFork0_~f21~0_7) InVars {~flag2~0=v_~flag2~0_4} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_7, ~flag2~0=v_~flag2~0_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 189#[L719, L761-3]don't care [193] L719-->L722: Formula: (= v_thr1Thread1of1ForFork0_~t1~0_7 v_~turn~0_6) InVars {~turn~0=v_~turn~0_6} OutVars{~turn~0=v_~turn~0_6, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0] 153#[L761-3, L722]don't care [2023-09-17 11:15:40,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:15:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1786762170, now seen corresponding path program 1 times [2023-09-17 11:15:40,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:15:40,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573335834] [2023-09-17 11:15:40,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:15:40,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:15:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:40,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:15:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:40,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:15:40,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:15:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash 216573, now seen corresponding path program 1 times [2023-09-17 11:15:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:15:40,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783164620] [2023-09-17 11:15:40,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:15:40,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:15:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:40,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:15:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:40,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:15:40,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:15:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1901920360, now seen corresponding path program 1 times [2023-09-17 11:15:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:15:40,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927207712] [2023-09-17 11:15:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:15:40,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:15:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:15:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:15:40,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:15:40,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927207712] [2023-09-17 11:15:40,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927207712] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:15:40,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:15:40,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-17 11:15:40,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396227321] [2023-09-17 11:15:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:15:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:15:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-17 11:15:40,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-17 11:15:40,891 INFO L87 Difference]: Start difference. First operand currently 2358 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2023-09-17 11:15:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:15:41,004 INFO L93 Difference]: Finished difference Result 3507 states and 9898 transitions. [2023-09-17 11:15:41,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3507 states and 9898 transitions. [2023-09-17 11:15:41,053 INFO L131 ngComponentsAnalysis]: Automaton has 290 accepting balls. 930 [2023-09-17 11:15:41,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3507 states to 2117 states and 5947 transitions. [2023-09-17 11:15:41,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2117 [2023-09-17 11:15:41,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2117 [2023-09-17 11:15:41,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2117 states and 5947 transitions. [2023-09-17 11:15:41,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:15:41,111 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2117 states and 5947 transitions. [2023-09-17 11:15:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states and 5947 transitions. [2023-09-17 11:15:41,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 1697. [2023-09-17 11:15:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1697 states have (on average 2.82203889216264) internal successors, (4789), 1696 states have internal predecessors, (4789), 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) [2023-09-17 11:15:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 4789 transitions. [2023-09-17 11:15:41,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1697 states and 4789 transitions. [2023-09-17 11:15:41,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-17 11:15:41,242 INFO L428 stractBuchiCegarLoop]: Abstraction has 1697 states and 4789 transitions. [2023-09-17 11:15:41,242 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 11:15:41,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1697 states and 4789 transitions. [2023-09-17 11:15:41,255 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 720 [2023-09-17 11:15:41,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:15:41,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:15:41,257 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:15:41,257 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-09-17 11:15:41,262 INFO L748 eck$LassoCheckResult]: Stem: 9101#[$Ultimate##0]don't care [117] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 9103#[L-1]don't care [132] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] 10367#[L-1-1]don't care [155] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 10369#[L12]don't care [109] L12-->L12-1: Formula: (and (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] 11551#[L12-1]don't care [124] 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[] 10583#[L12-2]don't care [122] 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[] 10585#[L12-3]don't care [145] L12-3-->L12-4: Formula: (and (= (select |v_#valid_2| 2) 1) (= (select |v_#length_2| 2) 11)) InVars {#length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 9971#[L12-4]don't care [139] L12-4-->L700: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0] 9973#[L700]don't care [156] L700-->L701: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0] 11051#[L701]don't care [148] L701-->L702: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0] 10721#[L702]don't care [113] L702-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 10723#[L-1-2]don't care [157] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 10963#[L-1-3]don't care [159] L-1-3-->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~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~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~nondet5#1, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre4#1] 10151#[L760]don't care [147] 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_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~1#1.base_2| 0)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 1) |v_#valid_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~1#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t1~1#1.base, #valid, #length] 10153#[L760-1]don't care [131] L760-1-->L760-2: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 4) |v_#length_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) 0) (= (store |v_#valid_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 1) |v_#valid_5|) (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_6|} 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, #valid, #length] 10939#[L760-2]don't care [142] 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] 9923#[L761]don't care [114] L761-->L761-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 9925#[L761-1]don't care [140] L761-1-->L761-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) 1) (<= (+ |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|) (= (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_7|, #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_7|, #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] 9939#[L761-2]don't care [202] L761-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_10, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~t1~0, thr1Thread1of1ForFork0_~_.offset] 9941#[$Ultimate##0, L761-3]don't care [163] 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] 10941#[L761-4, $Ultimate##0]don't care [133] 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] 10943#[$Ultimate##0, L762]don't care [112] 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] 11043#[L762-1, $Ultimate##0]don't care [121] 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] 11663#[$Ultimate##0, L762-2]don't care [107] 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_8| |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_8|, #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_8|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 11657#[L762-3, $Ultimate##0]don't care [205] L762-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_10, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_10, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 11661#[$Ultimate##0, $Ultimate##0, L762-4]don't care [166] $Ultimate##0-->L732: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base] 8553#[L732, $Ultimate##0, L762-4]don't care [167] L732-->L734: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 8555#[L734, $Ultimate##0, L762-4]don't care [168] L734-->L737: Formula: (= v_~turn~0_1 0) InVars {} OutVars{~turn~0=v_~turn~0_1} AuxVars[] AssignedVars[~turn~0] 10489#[$Ultimate##0, L737, L762-4]don't care [169] L737-->L740: Formula: (= v_~flag1~0_1 v_thr2Thread1of1ForFork1_~f12~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 10493#[$Ultimate##0, L740, L762-4]don't care [170] L740-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_1 v_~turn~0_2) InVars {~turn~0=v_~turn~0_2} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_1, ~turn~0=v_~turn~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 10661#[$Ultimate##0, L750, L762-4]don't care [2023-09-17 11:15:41,263 INFO L750 eck$LassoCheckResult]: Loop: 10661#[$Ultimate##0, L750, L762-4]don't care [171] L750-->L745: Formula: (and (= v_thr2Thread1of1ForFork1_~t2~0_3 0) (= v_thr2Thread1of1ForFork1_~f12~0_3 1)) InVars {thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_3, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_3, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_3} AuxVars[] AssignedVars[] 10663#[$Ultimate##0, L745, L762-4]don't care [174] L745-->L747: Formula: (= v_~flag1~0_2 v_thr2Thread1of1ForFork1_~f12~0_7) InVars {~flag1~0=v_~flag1~0_2} OutVars{~flag1~0=v_~flag1~0_2, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_7} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~f12~0] 11617#[$Ultimate##0, L762-4, L747]don't care [176] L747-->L750: Formula: (= v_thr2Thread1of1ForFork1_~t2~0_7 v_~turn~0_3) InVars {~turn~0=v_~turn~0_3} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_7, ~turn~0=v_~turn~0_3} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0] 10661#[$Ultimate##0, L750, L762-4]don't care [2023-09-17 11:15:41,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:15:41,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1774483976, now seen corresponding path program 1 times [2023-09-17 11:15:41,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:15:41,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396954469] [2023-09-17 11:15:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:15:41,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:15:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:15:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:15:41,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:15:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 199692, now seen corresponding path program 1 times [2023-09-17 11:15:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:15:41,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128494278] [2023-09-17 11:15:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:15:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:15:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:15:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:15:41,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:15:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1194819749, now seen corresponding path program 1 times [2023-09-17 11:15:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:15:41,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323546613] [2023-09-17 11:15:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:15:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:15:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:15:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:15:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:15:41,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323546613] [2023-09-17 11:15:41,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323546613] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:15:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:15:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-17 11:15:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433712307] [2023-09-17 11:15:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:15:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:15:41,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-17 11:15:41,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-17 11:15:41,467 INFO L87 Difference]: Start difference. First operand 1697 states and 4789 transitions. cyclomatic complexity: 3312 Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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) [2023-09-17 11:15:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:15:41,512 INFO L93 Difference]: Finished difference Result 2187 states and 6050 transitions. [2023-09-17 11:15:41,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2187 states and 6050 transitions. [2023-09-17 11:15:41,532 INFO L131 ngComponentsAnalysis]: Automaton has 230 accepting balls. 750 [2023-09-17 11:15:41,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2187 states to 1759 states and 4905 transitions. [2023-09-17 11:15:41,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1759 [2023-09-17 11:15:41,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1759 [2023-09-17 11:15:41,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1759 states and 4905 transitions. [2023-09-17 11:15:41,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:15:41,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1759 states and 4905 transitions. [2023-09-17 11:15:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states and 4905 transitions. [2023-09-17 11:15:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1519. [2023-09-17 11:15:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1519 states have (on average 2.8104015799868334) internal successors, (4269), 1518 states have internal predecessors, (4269), 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) [2023-09-17 11:15:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 4269 transitions. [2023-09-17 11:15:41,604 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1519 states and 4269 transitions. [2023-09-17 11:15:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-17 11:15:41,605 INFO L428 stractBuchiCegarLoop]: Abstraction has 1519 states and 4269 transitions. [2023-09-17 11:15:41,605 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-09-17 11:15:41,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1519 states and 4269 transitions. [2023-09-17 11:15:41,618 INFO L131 ngComponentsAnalysis]: Automaton has 190 accepting balls. 630 [2023-09-17 11:15:41,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:15:41,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:15:41,619 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:15:41,619 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-09-17 11:15:41,620 INFO L748 eck$LassoCheckResult]: Stem: 15069#[$Ultimate##0]don't care [117] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 15071#[L-1]don't care [132] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] 16371#[L-1-1]don't care [155] L-1-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 15951#[L12]don't care [109] L12-->L12-1: Formula: (and (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] 15953#[L12-1]don't care [124] 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[] 16009#[L12-2]don't care [122] 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[] 14813#[L12-3]don't care [145] L12-3-->L12-4: Formula: (and (= (select |v_#valid_2| 2) 1) (= (select |v_#length_2| 2) 11)) InVars {#length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 14815#[L12-4]don't care [139] L12-4-->L700: Formula: (= v_~flag1~0_5 0) InVars {} OutVars{~flag1~0=v_~flag1~0_5} AuxVars[] AssignedVars[~flag1~0] 16035#[L700]don't care [156] L700-->L701: Formula: (= v_~flag2~0_5 0) InVars {} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[~flag2~0] 16775#[L701]don't care [148] L701-->L702: Formula: (= v_~turn~0_7 0) InVars {} OutVars{~turn~0=v_~turn~0_7} AuxVars[] AssignedVars[~turn~0] 16621#[L702]don't care [113] L702-->L-1-2: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 16623#[L-1-2]don't care [157] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 16727#[L-1-3]don't care [159] L-1-3-->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~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~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~nondet5#1, ULTIMATE.start_main_~#t1~1#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre4#1] 16197#[L760]don't care [147] 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_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~1#1.base_2| 0)) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t1~1#1.base_2| 1) |v_#valid_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~1#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} 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_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~1#1.offset, ULTIMATE.start_main_~#t1~1#1.base, #valid, #length] 16199#[L760-1]don't care [131] L760-1-->L760-2: Formula: (and (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 4) |v_#length_5|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2|) 0) (= (store |v_#valid_6| |v_ULTIMATE.start_main_~#t2~1#1.base_2| 1) |v_#valid_5|) (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_6|} 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~1#1.base, ULTIMATE.start_main_~#t2~1#1.offset, #valid, #length] 16721#[L760-2]don't care [142] 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] 15987#[L761]don't care [114] L761-->L761-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 15989#[L761-1]don't care [140] L761-1-->L761-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~1#1.base_3|) 1) (<= (+ |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|) (= (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_7|, #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_7|, #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] 16015#[L761-2]don't care [202] L761-2-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_10, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_10, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~f21~0, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~t1~0, thr1Thread1of1ForFork0_~_.offset] 16017#[$Ultimate##0, L761-3]don't care [163] 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] 16723#[L761-4, $Ultimate##0]don't care [133] 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] 16725#[$Ultimate##0, L762]don't care [112] 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] 16673#[L762-1, $Ultimate##0]don't care [183] $Ultimate##0-->L704: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset] 16207#[L762-1, L704]don't care [184] L704-->L706: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0] 14317#[L762-1, L706]don't care [121] 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] 14889#[L762-2, L706]don't care [185] L706-->L709: Formula: (= v_~turn~0_4 1) InVars {} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[~turn~0] 15977#[L709, L762-2]don't care [107] 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_8| |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_8|, #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_8|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[#memory_int] 15851#[L762-3, L709]don't care [205] L762-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thr2Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thr2Thread1of1ForFork1_~t2~0=v_thr2Thread1of1ForFork1_~t2~0_10, thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~f12~0=v_thr2Thread1of1ForFork1_~f12~0_10, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~t2~0, thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~f12~0, thr2Thread1of1ForFork1_~_.base] 14571#[L709, $Ultimate##0, L762-4]don't care [166] $Ultimate##0-->L732: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base] 14573#[L732, L709, L762-4]don't care [167] L732-->L734: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 16739#[L709, L734, L762-4]don't care [186] L709-->L712: Formula: (= v_~flag2~0_3 v_thr1Thread1of1ForFork0_~f21~0_1) InVars {~flag2~0=v_~flag2~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_1, ~flag2~0=v_~flag2~0_3} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 16817#[L734, L712, L762-4]don't care [187] L712-->L722: Formula: (= v_thr1Thread1of1ForFork0_~t1~0_1 v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0] 16169#[L722, L734, L762-4]don't care [2023-09-17 11:15:41,620 INFO L750 eck$LassoCheckResult]: Loop: 16169#[L722, L734, L762-4]don't care [188] L722-->L717: Formula: (and (= v_thr1Thread1of1ForFork0_~f21~0_3 1) (= v_thr1Thread1of1ForFork0_~t1~0_3 1)) InVars {thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_3} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_3, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_3} AuxVars[] AssignedVars[] 16537#[L717, L734, L762-4]don't care [191] L717-->L719: Formula: (= v_~flag2~0_4 v_thr1Thread1of1ForFork0_~f21~0_7) InVars {~flag2~0=v_~flag2~0_4} OutVars{thr1Thread1of1ForFork0_~f21~0=v_thr1Thread1of1ForFork0_~f21~0_7, ~flag2~0=v_~flag2~0_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~f21~0] 16167#[L734, L719, L762-4]don't care [193] L719-->L722: Formula: (= v_thr1Thread1of1ForFork0_~t1~0_7 v_~turn~0_6) InVars {~turn~0=v_~turn~0_6} OutVars{~turn~0=v_~turn~0_6, thr1Thread1of1ForFork0_~t1~0=v_thr1Thread1of1ForFork0_~t1~0_7} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~t1~0] 16169#[L722, L734, L762-4]don't care [2023-09-17 11:15:41,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:15:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1069931712, now seen corresponding path program 1 times [2023-09-17 11:15:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:15:41,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432191888] [2023-09-17 11:15:41,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:15:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:15:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:15:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:15:41,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:15:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash 216573, now seen corresponding path program 2 times [2023-09-17 11:15:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:15:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551196258] [2023-09-17 11:15:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:15:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:15:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:15:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:15:41,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:15:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1383515358, now seen corresponding path program 1 times [2023-09-17 11:15:41,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:15:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582138381] [2023-09-17 11:15:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:15:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:15:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:15:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:41,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:15:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:42,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:15:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:15:42,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:15:42 BoogieIcfgContainer [2023-09-17 11:15:42,887 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:15:42,887 INFO L158 Benchmark]: Toolchain (without parser) took 3862.84ms. Allocated memory was 179.3MB in the beginning and 256.9MB in the end (delta: 77.6MB). Free memory was 131.4MB in the beginning and 170.6MB in the end (delta: -39.2MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. [2023-09-17 11:15:42,888 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:15:42,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.70ms. Allocated memory is still 179.3MB. Free memory was 131.1MB in the beginning and 111.5MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-09-17 11:15:42,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.01ms. Allocated memory is still 179.3MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 11:15:42,899 INFO L158 Benchmark]: Boogie Preprocessor took 19.92ms. Allocated memory is still 179.3MB. Free memory was 109.4MB in the beginning and 108.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:15:42,899 INFO L158 Benchmark]: RCFGBuilder took 335.56ms. Allocated memory is still 179.3MB. Free memory was 108.0MB in the beginning and 95.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-09-17 11:15:42,902 INFO L158 Benchmark]: BuchiAutomizer took 3022.40ms. Allocated memory was 179.3MB in the beginning and 256.9MB in the end (delta: 77.6MB). Free memory was 95.4MB in the beginning and 170.6MB in the end (delta: -75.2MB). Peak memory consumption was 3.6MB. Max. memory is 8.0GB. [2023-09-17 11:15:42,904 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.12ms. Allocated memory is still 179.3MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 446.70ms. Allocated memory is still 179.3MB. Free memory was 131.1MB in the beginning and 111.5MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.01ms. Allocated memory is still 179.3MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.92ms. Allocated memory is still 179.3MB. Free memory was 109.4MB in the beginning and 108.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 335.56ms. Allocated memory is still 179.3MB. Free memory was 108.0MB in the beginning and 95.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3022.40ms. Allocated memory was 179.3MB in the beginning and 256.9MB in the end (delta: 77.6MB). Free memory was 95.4MB in the beginning and 170.6MB in the end (delta: -75.2MB). Peak memory consumption was 3.6MB. 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 1519 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 660 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s 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, 158 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 158 mSDsluCounter, 419 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 174 mSDtfsCounter, 37 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={19144:0}, t2={19143:0}, turn=0, x=0] [L761] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=5019, t1={19144:0}, t2={19143: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 [_={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=5020, t1={19144:0}, t2={19143:0}, turn=1, x=0] [L733] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] [L711] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, turn=1, x=0] [L714] 1 int t1 = turn; VAL [_={0:0}, _={0:0}, _={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={19144:0}, t2={19143:0}, turn=0, x=0] [L761] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [_={0:0}, flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=5019, t1={19144:0}, t2={19143: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 [_={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=5020, t1={19144:0}, t2={19143:0}, turn=1, x=0] [L733] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, turn=1, x=0] [L711] 1 int f21 = flag2; VAL [_={0:0}, _={0:0}, _={0:0}, _={0:0}, f21=1, flag1=1, flag2=1, turn=1, x=0] [L714] 1 int t1 = turn; VAL [_={0:0}, _={0:0}, _={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! [2023-09-17 11:15:42,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...