/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:33:06,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:33:06,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:33:06,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:33:06,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:33:06,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:33:06,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:33:06,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:33:06,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:33:06,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:33:06,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:33:06,683 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:33:06,683 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:33:06,684 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:33:06,685 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:33:06,685 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:33:06,685 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:33:06,685 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:33:06,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:33:06,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:33:06,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:33:06,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:33:06,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:33:06,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:33:06,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:33:06,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:33:06,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:33:06,689 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:33:06,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:33:06,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:33:06,689 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:33:06,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:33:06,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:33:06,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:33:06,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:33:06,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:33:06,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:33:06,691 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:33:06,691 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:33:07,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:33:07,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:33:07,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:33:07,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:33:07,034 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:33:07,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2024-02-10 00:33:08,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:33:08,713 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:33:08,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2024-02-10 00:33:08,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8be8d7169/a31d58c7757040c486f7a0fb5a1123c9/FLAGee8f6704e [2024-02-10 00:33:08,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8be8d7169/a31d58c7757040c486f7a0fb5a1123c9 [2024-02-10 00:33:08,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:33:08,754 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:33:08,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:33:08,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:33:08,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:33:08,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:33:08" (1/1) ... [2024-02-10 00:33:08,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2721c719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:08, skipping insertion in model container [2024-02-10 00:33:08,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:33:08" (1/1) ... [2024-02-10 00:33:08,817 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:33:09,052 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-10 00:33:09,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:33:09,217 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:33:09,241 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2024-02-10 00:33:09,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:33:09,309 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:33:09,310 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:33:09,310 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 00:33:09,317 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:33:09,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09 WrapperNode [2024-02-10 00:33:09,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:33:09,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:33:09,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:33:09,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:33:09,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,367 INFO L138 Inliner]: procedures = 172, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-02-10 00:33:09,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:33:09,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:33:09,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:33:09,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:33:09,382 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:33:09,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:33:09,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:33:09,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:33:09,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (1/1) ... [2024-02-10 00:33:09,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:33:09,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:33:09,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:33:09,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 00:33:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:33:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-02-10 00:33:09,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-02-10 00:33:09,509 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-02-10 00:33:09,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-02-10 00:33:09,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:33:09,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 00:33:09,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:33:09,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:33:09,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:33:09,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:33:09,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 00:33:09,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:33:09,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:33:09,513 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:33:09,668 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:33:09,670 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:33:09,898 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:33:09,905 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:33:09,905 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-10 00:33:09,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:33:09 BoogieIcfgContainer [2024-02-10 00:33:09,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:33:09,908 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:33:09,908 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:33:09,912 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:33:09,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:33:09,913 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:33:08" (1/3) ... [2024-02-10 00:33:09,914 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53e1a1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:33:09, skipping insertion in model container [2024-02-10 00:33:09,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:33:09,914 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:33:09" (2/3) ... [2024-02-10 00:33:09,914 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53e1a1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:33:09, skipping insertion in model container [2024-02-10 00:33:09,914 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:33:09,914 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:33:09" (3/3) ... [2024-02-10 00:33:09,915 INFO L332 chiAutomizerObserver]: Analyzing ICFG dekker.i [2024-02-10 00:33:09,988 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:33:10,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 114 transitions, 242 flow [2024-02-10 00:33:10,059 INFO L124 PetriNetUnfolderBase]: 15/110 cut-off events. [2024-02-10 00:33:10,059 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:33:10,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 110 events. 15/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 203 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2024-02-10 00:33:10,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 114 transitions, 242 flow [2024-02-10 00:33:10,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 110 transitions, 232 flow [2024-02-10 00:33:10,079 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:33:10,079 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:33:10,079 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:33:10,079 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:33:10,079 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:33:10,079 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:33:10,080 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:33:10,080 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:33:10,080 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 102 places, 110 transitions, 232 flow [2024-02-10 00:33:10,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:10,096 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2024-02-10 00:33:10,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:33:10,097 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:10,100 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:33:10,101 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 102 places, 110 transitions, 232 flow [2024-02-10 00:33:10,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:10,110 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2024-02-10 00:33:10,110 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 00:33:10,110 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:10,118 INFO L748 eck$LassoCheckResult]: Stem: 108#[$Ultimate##0]true [197] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 110#[L-1]true [211] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_3|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|} AuxVars[] AssignedVars[] 112#[L16]true [262] L16-->L16-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 114#[L16-1]true [179] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 116#[L16-2]true [283] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_1| 1) 1) 0) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 118#[L16-3]true [272] L16-3-->L16-4: Formula: (and (= (select |v_#valid_1| 2) 1) (= (select |v_#length_1| 2) 9)) InVars {#length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] 120#[L16-4]true [222] L16-4-->L704: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0] 122#[L704]true [227] L704-->L705: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0] 124#[L705]true [265] L705-->L706: Formula: (= v_~turn~0_9 0) InVars {} OutVars{~turn~0=v_~turn~0_9} AuxVars[] AssignedVars[~turn~0] 126#[L706]true [270] L706-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 128#[L-1-1]true [278] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 130#[L-1-2]true [279] L-1-2-->L790: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 132#[L790]true [241] L790-->L790-1: Formula: (and (= (store |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_2|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 134#[L790-1]true [267] L790-1-->L790-2: Formula: (and (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 136#[L790-2]true [254] L790-2-->L791: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= v_~turn~0_10 1) (<= 0 v_~turn~0_10)) 1 0)) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 138#[L791]true [200] L791-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 140#[L2]true [239] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 142#[L3]true [230] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 144#[L2-1]true [199] L2-1-->L791-1: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 146#[L791-1]true [196] L791-1-->L792: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 148#[L792]true [185] L792-->L792-1: 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] 150#[L792-1]true [232] L792-1-->L792-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 152#[L792-2]true [198] L792-2-->L792-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= |v_#memory_int_2| (store |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)))) InVars {#valid=|v_#valid_6|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 154#[L792-3]true [355] L792-3-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_10|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_18|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_~f2~0#1, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~t~0#1, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~_#1.base] 156#[L792-4, $Ultimate##0]true [319] $Ultimate##0-->L708: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base] 158#[L708, L792-4]true [320] L708-->L710: Formula: (= v_~flag1~0_6 1) InVars {} OutVars{~flag1~0=v_~flag1~0_6} AuxVars[] AssignedVars[~flag1~0] 160#[L792-4, L710]true [321] L710-->L714-1: Formula: (= v_~flag2~0_5 |v_thr1Thread1of1ForFork1_~f2~0#1_1|) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_1|, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0#1] 162#[L792-4, L714-1]true [2024-02-10 00:33:10,119 INFO L750 eck$LassoCheckResult]: Loop: 162#[L792-4, L714-1]true [322] L714-1-->L715: Formula: (<= 1 |v_thr1Thread1of1ForFork1_~f2~0#1_3|) InVars {thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_3|} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_3|} AuxVars[] AssignedVars[] 165#[L792-4, L715]true [325] L715-->L717: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_1| v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0#1] 167#[L792-4, L717]true [328] L717-->L718: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_5| 0) InVars {thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_5|} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_5|} AuxVars[] AssignedVars[] 169#[L792-4, L718]true [332] L718-->L736: Formula: (= v_~flag2~0_6 |v_thr1Thread1of1ForFork1_~f2~0#1_7|) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_7|, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0#1] 171#[L792-4, L736]true [336] L736-->L714-1: Formula: true InVars {} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_9|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0#1] 162#[L792-4, L714-1]true [2024-02-10 00:33:10,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash -467204160, now seen corresponding path program 1 times [2024-02-10 00:33:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:10,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899652477] [2024-02-10 00:33:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:10,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:10,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash 336010824, now seen corresponding path program 1 times [2024-02-10 00:33:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:10,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115665456] [2024-02-10 00:33:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:10,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:10,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:10,320 INFO L85 PathProgramCache]: Analyzing trace with hash -400943639, now seen corresponding path program 1 times [2024-02-10 00:33:10,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644575858] [2024-02-10 00:33:10,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:10,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:33:10,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:10,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644575858] [2024-02-10 00:33:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644575858] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:10,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:10,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:10,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485687877] [2024-02-10 00:33:10,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:33:10,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:33:11,025 INFO L175 Difference]: Start difference. First operand has 102 places, 110 transitions, 232 flow. Second operand 5 states and 570 transitions. [2024-02-10 00:33:11,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 110 transitions, 232 flow. Second operand 5 states and 570 transitions. [2024-02-10 00:33:11,029 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 114 [2024-02-10 00:33:11,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:11,081 INFO L124 PetriNetUnfolderBase]: 32/247 cut-off events. [2024-02-10 00:33:11,081 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-10 00:33:11,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 247 events. 32/247 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 989 event pairs, 2 based on Foata normal form. 49/263 useless extension candidates. Maximal degree in co-relation 238. Up to 18 conditions per place. [2024-02-10 00:33:11,094 INFO L140 encePairwiseOnDemand]: 97/114 looper letters, 5 selfloop transitions, 11 changer transitions 0/104 dead transitions. [2024-02-10 00:33:11,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 252 flow [2024-02-10 00:33:11,098 INFO L231 Difference]: Finished difference. Result has 109 places, 103 transitions, 265 flow [2024-02-10 00:33:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-10 00:33:11,105 INFO L428 stractBuchiCegarLoop]: Abstraction has has 109 places, 103 transitions, 265 flow [2024-02-10 00:33:11,105 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:33:11,105 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 places, 103 transitions, 265 flow [2024-02-10 00:33:11,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:11,133 INFO L124 PetriNetUnfolderBase]: 0/65 cut-off events. [2024-02-10 00:33:11,133 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-02-10 00:33:11,133 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:11,135 INFO L748 eck$LassoCheckResult]: Stem: 108#[$Ultimate##0]true [197] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 110#[L-1]true [211] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_3|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|} AuxVars[] AssignedVars[] 112#[L16]true [262] L16-->L16-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 114#[L16-1]true [179] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 116#[L16-2]true [283] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_1| 1) 1) 0) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 118#[L16-3]true [272] L16-3-->L16-4: Formula: (and (= (select |v_#valid_1| 2) 1) (= (select |v_#length_1| 2) 9)) InVars {#length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] 120#[L16-4]true [222] L16-4-->L704: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0] 122#[L704]true [227] L704-->L705: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0] 124#[L705]true [265] L705-->L706: Formula: (= v_~turn~0_9 0) InVars {} OutVars{~turn~0=v_~turn~0_9} AuxVars[] AssignedVars[~turn~0] 126#[L706]true [270] L706-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 128#[L-1-1]true [278] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 130#[L-1-2]true [279] L-1-2-->L790: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 132#[L790]true [241] L790-->L790-1: Formula: (and (= (store |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_2|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 134#[L790-1]true [267] L790-1-->L790-2: Formula: (and (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 136#[L790-2]true [254] L790-2-->L791: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= v_~turn~0_10 1) (<= 0 v_~turn~0_10)) 1 0)) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 138#[L791]true [200] L791-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 140#[L2]true [239] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 142#[L3]true [230] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 144#[L2-1]true [199] L2-1-->L791-1: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 146#[L791-1]true [196] L791-1-->L792: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 148#[L792]true [185] L792-->L792-1: 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] 150#[L792-1]true [232] L792-1-->L792-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 152#[L792-2]true [198] L792-2-->L792-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= |v_#memory_int_2| (store |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)))) InVars {#valid=|v_#valid_6|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 154#[L792-3]true [355] L792-3-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_10|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_18|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_~f2~0#1, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~t~0#1, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~_#1.base] 156#[L792-4, $Ultimate##0]true [216] L792-4-->L792-5: 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] 248#[L792-5, $Ultimate##0]true [181] L792-5-->L793: 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] 250#[$Ultimate##0, L793]true [212] L793-->L793-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] 252#[$Ultimate##0, L793-1]true [194] L793-1-->L793-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 254#[L793-2, $Ultimate##0]true [240] L793-2-->L793-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_4|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_5|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 256#[L793-3, $Ultimate##0]true [352] L793-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork0_thidvar0_2) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_18|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_10|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~t~1#1, thr2Thread1of1ForFork0_#in~_#1.offset, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_~f1~0#1, thr2Thread1of1ForFork0_#res#1.base] 258#[$Ultimate##0, $Ultimate##0, L793-4]true [288] $Ultimate##0-->L749: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset] 260#[L749, $Ultimate##0, L793-4]true [289] L749-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 262#[L751, $Ultimate##0, L793-4]true [290] L751-->L755-1: Formula: (= v_~flag1~0_1 |v_thr2Thread1of1ForFork0_~f1~0#1_1|) InVars {~flag1~0=v_~flag1~0_1} OutVars{thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_1|, ~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~f1~0#1] 264#[L755-1, $Ultimate##0, L793-4]true [2024-02-10 00:33:11,136 INFO L750 eck$LassoCheckResult]: Loop: 264#[L755-1, $Ultimate##0, L793-4]true [291] L755-1-->L756: Formula: (<= 1 |v_thr2Thread1of1ForFork0_~f1~0#1_3|) InVars {thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_3|} OutVars{thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_3|} AuxVars[] AssignedVars[] 267#[$Ultimate##0, L793-4, L756]true [294] L756-->L758: Formula: (= |v_thr2Thread1of1ForFork0_~t~1#1_1| v_~turn~0_1) InVars {~turn~0=v_~turn~0_1} OutVars{~turn~0=v_~turn~0_1, thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~t~1#1] 269#[L758, $Ultimate##0, L793-4]true [297] L758-->L759: Formula: (= |v_thr2Thread1of1ForFork0_~t~1#1_5| 1) InVars {thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_5|} OutVars{thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_5|} AuxVars[] AssignedVars[] 271#[$Ultimate##0, L759, L793-4]true [301] L759-->L777: Formula: (= v_~flag1~0_2 |v_thr2Thread1of1ForFork0_~f1~0#1_7|) InVars {~flag1~0=v_~flag1~0_2} OutVars{thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_7|, ~flag1~0=v_~flag1~0_2} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~f1~0#1] 273#[$Ultimate##0, L793-4, L777]true [305] L777-->L755-1: Formula: true InVars {} OutVars{thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_9|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~t~1#1] 264#[L755-1, $Ultimate##0, L793-4]true [2024-02-10 00:33:11,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1488615450, now seen corresponding path program 1 times [2024-02-10 00:33:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595501933] [2024-02-10 00:33:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:11,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash 306427369, now seen corresponding path program 1 times [2024-02-10 00:33:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375401878] [2024-02-10 00:33:11,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:11,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash 320886052, now seen corresponding path program 1 times [2024-02-10 00:33:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248694938] [2024-02-10 00:33:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:33:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:33:11,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:33:11,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248694938] [2024-02-10 00:33:11,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248694938] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:33:11,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:33:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-10 00:33:11,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124478981] [2024-02-10 00:33:11,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:33:11,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:33:11,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-10 00:33:11,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-10 00:33:11,482 INFO L175 Difference]: Start difference. First operand has 109 places, 103 transitions, 265 flow. Second operand 5 states and 570 transitions. [2024-02-10 00:33:11,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 103 transitions, 265 flow. Second operand 5 states and 570 transitions. [2024-02-10 00:33:11,487 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 114 [2024-02-10 00:33:11,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:33:11,574 INFO L124 PetriNetUnfolderBase]: 60/440 cut-off events. [2024-02-10 00:33:11,574 INFO L125 PetriNetUnfolderBase]: For 57/60 co-relation queries the response was YES. [2024-02-10 00:33:11,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 440 events. 60/440 cut-off events. For 57/60 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2596 event pairs, 4 based on Foata normal form. 5/400 useless extension candidates. Maximal degree in co-relation 495. Up to 25 conditions per place. [2024-02-10 00:33:11,581 INFO L140 encePairwiseOnDemand]: 106/114 looper letters, 6 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2024-02-10 00:33:11,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 111 transitions, 318 flow [2024-02-10 00:33:11,584 INFO L231 Difference]: Finished difference. Result has 116 places, 109 transitions, 324 flow [2024-02-10 00:33:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-10 00:33:11,585 INFO L428 stractBuchiCegarLoop]: Abstraction has has 116 places, 109 transitions, 324 flow [2024-02-10 00:33:11,586 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:33:11,586 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 116 places, 109 transitions, 324 flow [2024-02-10 00:33:11,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:33:11,602 INFO L124 PetriNetUnfolderBase]: 1/93 cut-off events. [2024-02-10 00:33:11,602 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-02-10 00:33:11,603 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:33:11,606 INFO L748 eck$LassoCheckResult]: Stem: 108#[$Ultimate##0]true [197] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_14| 0) 0) InVars {#valid=|v_#valid_14|} OutVars{#valid=|v_#valid_14|} AuxVars[] AssignedVars[] 110#[L-1]true [211] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_3|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|} AuxVars[] AssignedVars[] 112#[L16]true [262] L16-->L16-1: Formula: (and (= (select |v_#valid_15| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] 114#[L16-1]true [179] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_8| 1) 0) 48) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 116#[L16-2]true [283] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_1| 1) 1) 0) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 118#[L16-3]true [272] L16-3-->L16-4: Formula: (and (= (select |v_#valid_1| 2) 1) (= (select |v_#length_1| 2) 9)) InVars {#length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[] 120#[L16-4]true [222] L16-4-->L704: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0] 122#[L704]true [227] L704-->L705: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0] 124#[L705]true [265] L705-->L706: Formula: (= v_~turn~0_9 0) InVars {} OutVars{~turn~0=v_~turn~0_9} AuxVars[] AssignedVars[~turn~0] 126#[L706]true [270] L706-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0] 128#[L-1-1]true [278] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 130#[L-1-2]true [279] L-1-2-->L790: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~mem9#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 132#[L790]true [241] L790-->L790-1: Formula: (and (= (store |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_2|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_2|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 134#[L790-1]true [267] L790-1-->L790-2: Formula: (and (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 136#[L790-2]true [254] L790-2-->L791: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= v_~turn~0_10 1) (<= 0 v_~turn~0_10)) 1 0)) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 138#[L791]true [200] L791-->L2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 140#[L2]true [239] L2-->L3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 142#[L3]true [230] L3-->L2-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 144#[L2-1]true [199] L2-1-->L791-1: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 146#[L791-1]true [196] L791-1-->L792: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 148#[L792]true [185] L792-->L792-1: 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] 150#[L792-1]true [232] L792-1-->L792-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 152#[L792-2]true [198] L792-2-->L792-3: Formula: (and (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_6| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= |v_#memory_int_2| (store |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_3| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)))) InVars {#valid=|v_#valid_6|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 154#[L792-3]true [355] L792-3-->$Ultimate##0: Formula: (and (= |v_thr1Thread1of1ForFork1_#in~_#1.offset_4| 0) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_7| v_thr1Thread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_4|, thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_10|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_4|, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_18|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset_8|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_7|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_4|, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2, thr1Thread1of1ForFork1_#res#1.base=|v_thr1Thread1of1ForFork1_#res#1.base_4|, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base=|v_thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base_8|, thr1Thread1of1ForFork1_#res#1.offset=|v_thr1Thread1of1ForFork1_#res#1.offset_4|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_#1.base, thr1Thread1of1ForFork1_~f2~0#1, thr1Thread1of1ForFork1_#in~_#1.offset, thr1Thread1of1ForFork1_#res#1.offset, thr1Thread1of1ForFork1_~t~0#1, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_thidvar0, thr1Thread1of1ForFork1_#res#1.base, thr1Thread1of1ForFork1_reach_error_#t~nondet0#1.base, thr1Thread1of1ForFork1_~_#1.base] 156#[L792-4, $Ultimate##0]true [216] L792-4-->L792-5: 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] 248#[L792-5, $Ultimate##0]true [319] $Ultimate##0-->L708: Formula: (and (= |v_thr1Thread1of1ForFork1_~_#1.offset_1| |v_thr1Thread1of1ForFork1_#in~_#1.offset_1|) (= |v_thr1Thread1of1ForFork1_#in~_#1.base_1| |v_thr1Thread1of1ForFork1_~_#1.base_1|)) InVars {thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|} OutVars{thr1Thread1of1ForFork1_#in~_#1.base=|v_thr1Thread1of1ForFork1_#in~_#1.base_1|, thr1Thread1of1ForFork1_#in~_#1.offset=|v_thr1Thread1of1ForFork1_#in~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.offset=|v_thr1Thread1of1ForFork1_~_#1.offset_1|, thr1Thread1of1ForFork1_~_#1.base=|v_thr1Thread1of1ForFork1_~_#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_#1.offset, thr1Thread1of1ForFork1_~_#1.base] 317#[L708, L792-5]true [181] L792-5-->L793: 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] 319#[L708, L793]true [320] L708-->L710: Formula: (= v_~flag1~0_6 1) InVars {} OutVars{~flag1~0=v_~flag1~0_6} AuxVars[] AssignedVars[~flag1~0] 321#[L710, L793]true [212] L793-->L793-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] 323#[L710, L793-1]true [194] L793-1-->L793-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 325#[L793-2, L710]true [240] L793-2-->L793-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_4|) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_7| |v_ULTIMATE.start_main_~#t2~0#1.base_3|))) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_5|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 327#[L793-3, L710]true [352] L793-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_7| v_thr2Thread1of1ForFork0_thidvar0_2) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= |v_thr2Thread1of1ForFork0_#in~_#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_7|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset_8|, thr2Thread1of1ForFork0_#res#1.offset=|v_thr2Thread1of1ForFork0_#res#1.offset_4|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_4|, thr2Thread1of1ForFork0_~t~1#1=|v_thr2Thread1of1ForFork0_~t~1#1_18|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_4|, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base_8|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_4|, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_4|, thr2Thread1of1ForFork0_~f1~0#1=|v_thr2Thread1of1ForFork0_~f1~0#1_10|, thr2Thread1of1ForFork0_#res#1.base=|v_thr2Thread1of1ForFork0_#res#1.base_4|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.offset, thr2Thread1of1ForFork0_#res#1.offset, thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~t~1#1, thr2Thread1of1ForFork0_#in~_#1.offset, thr2Thread1of1ForFork0_reach_error_#t~nondet0#1.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_#in~_#1.base, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_~_#1.offset, thr2Thread1of1ForFork0_~f1~0#1, thr2Thread1of1ForFork0_#res#1.base] 329#[L710, $Ultimate##0, L793-4]true [288] $Ultimate##0-->L749: Formula: (and (= |v_thr2Thread1of1ForFork0_~_#1.base_1| |v_thr2Thread1of1ForFork0_#in~_#1.base_1|) (= |v_thr2Thread1of1ForFork0_~_#1.offset_1| |v_thr2Thread1of1ForFork0_#in~_#1.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} OutVars{thr2Thread1of1ForFork0_~_#1.offset=|v_thr2Thread1of1ForFork0_~_#1.offset_1|, thr2Thread1of1ForFork0_~_#1.base=|v_thr2Thread1of1ForFork0_~_#1.base_1|, thr2Thread1of1ForFork0_#in~_#1.offset=|v_thr2Thread1of1ForFork0_#in~_#1.offset_1|, thr2Thread1of1ForFork0_#in~_#1.base=|v_thr2Thread1of1ForFork0_#in~_#1.base_1|} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_#1.base, thr2Thread1of1ForFork0_~_#1.offset] 331#[L749, L710, L793-4]true [289] L749-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0] 333#[L751, L710, L793-4]true [321] L710-->L714-1: Formula: (= v_~flag2~0_5 |v_thr1Thread1of1ForFork1_~f2~0#1_1|) InVars {~flag2~0=v_~flag2~0_5} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_1|, ~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0#1] 335#[L751, L714-1, L793-4]true [2024-02-10 00:33:11,607 INFO L750 eck$LassoCheckResult]: Loop: 335#[L751, L714-1, L793-4]true [322] L714-1-->L715: Formula: (<= 1 |v_thr1Thread1of1ForFork1_~f2~0#1_3|) InVars {thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_3|} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_3|} AuxVars[] AssignedVars[] 338#[L751, L715, L793-4]true [325] L715-->L717: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_1| v_~turn~0_5) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5, thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_1|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0#1] 340#[L751, L717, L793-4]true [328] L717-->L718: Formula: (= |v_thr1Thread1of1ForFork1_~t~0#1_5| 0) InVars {thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_5|} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_5|} AuxVars[] AssignedVars[] 342#[L718, L751, L793-4]true [332] L718-->L736: Formula: (= v_~flag2~0_6 |v_thr1Thread1of1ForFork1_~f2~0#1_7|) InVars {~flag2~0=v_~flag2~0_6} OutVars{thr1Thread1of1ForFork1_~f2~0#1=|v_thr1Thread1of1ForFork1_~f2~0#1_7|, ~flag2~0=v_~flag2~0_6} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~f2~0#1] 344#[L751, L736, L793-4]true [336] L736-->L714-1: Formula: true InVars {} OutVars{thr1Thread1of1ForFork1_~t~0#1=|v_thr1Thread1of1ForFork1_~t~0#1_9|} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~t~0#1] 335#[L751, L714-1, L793-4]true [2024-02-10 00:33:11,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -288296848, now seen corresponding path program 1 times [2024-02-10 00:33:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952100561] [2024-02-10 00:33:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:11,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash 336010824, now seen corresponding path program 2 times [2024-02-10 00:33:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786819587] [2024-02-10 00:33:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:11,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:33:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash 800463673, now seen corresponding path program 1 times [2024-02-10 00:33:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:33:11,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721555078] [2024-02-10 00:33:11,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:33:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:33:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:11,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:33:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:33:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:33:12,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:33:12 BoogieIcfgContainer [2024-02-10 00:33:12,868 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:33:12,868 INFO L158 Benchmark]: Toolchain (without parser) took 4114.28ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 110.5MB in the beginning and 158.9MB in the end (delta: -48.4MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,869 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory was 121.7MB in the beginning and 121.6MB in the end (delta: 178.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:33:12,869 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.52ms. Allocated memory is still 182.5MB. Free memory was 110.3MB in the beginning and 139.7MB in the end (delta: -29.4MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.43ms. Allocated memory is still 182.5MB. Free memory was 139.7MB in the beginning and 137.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,870 INFO L158 Benchmark]: Boogie Preprocessor took 46.54ms. Allocated memory is still 182.5MB. Free memory was 137.5MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,871 INFO L158 Benchmark]: RCFGBuilder took 487.01ms. Allocated memory is still 182.5MB. Free memory was 136.0MB in the beginning and 120.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,871 INFO L158 Benchmark]: BuchiAutomizer took 2959.24ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 120.8MB in the beginning and 158.9MB in the end (delta: -38.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-02-10 00:33:12,873 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.14ms. Allocated memory is still 182.5MB. Free memory was 121.7MB in the beginning and 121.6MB in the end (delta: 178.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 559.52ms. Allocated memory is still 182.5MB. Free memory was 110.3MB in the beginning and 139.7MB in the end (delta: -29.4MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.43ms. Allocated memory is still 182.5MB. Free memory was 139.7MB in the beginning and 137.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.54ms. Allocated memory is still 182.5MB. Free memory was 137.5MB in the beginning and 136.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 487.01ms. Allocated memory is still 182.5MB. Free memory was 136.0MB in the beginning and 120.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 2959.24ms. Allocated memory was 182.5MB in the beginning and 245.4MB in the end (delta: 62.9MB). Free memory was 120.8MB in the beginning and 158.9MB in the end (delta: -38.1MB). Peak memory consumption was 25.2MB. 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 324 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 2.0s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 561 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 561 mSDsluCounter, 1354 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 760 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 594 mSDtfsCounter, 106 mSolverCounterSat, 0.1s 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: 714]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L704] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L705] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L706] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L790] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={12784:0}, t2={12783:0}, turn=0, x=0] [L791] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L791] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L792] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=-2, t1={12784:0}, t2={12783:0}, turn=0, x=0] [L709] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L793] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=-1, t1={12784:0}, t2={12783:0}, turn=0, x=0] [L750] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L712] 1 int f2 = flag2; VAL [_={0:0}, _={0:0}, f2=1, flag1=1, flag2=1, turn=0, x=0] Loop: [L714] COND TRUE f2 >= 1 [L716] int t = turn; [L718] COND FALSE, EXPR !(t != 0) [L735] EXPR f2 = flag2 [L714-L737] { __VERIFIER_atomic_begin(); int t = turn; __VERIFIER_atomic_end(); if (t != 0) { __VERIFIER_atomic_begin(); flag1 = 0; __VERIFIER_atomic_end(); __VERIFIER_atomic_begin(); t = turn; __VERIFIER_atomic_end(); while (t != 0) { __VERIFIER_atomic_begin(); t = turn; __VERIFIER_atomic_end(); }; __VERIFIER_atomic_begin(); flag1 = 1; __VERIFIER_atomic_end(); } __VERIFIER_atomic_begin(); f2 = flag2; __VERIFIER_atomic_end(); } End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 714]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L704] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L705] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L706] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L790] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, t1={12784:0}, t2={12783:0}, turn=0, x=0] [L791] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L791] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L792] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, pthread_create(&t1, 0, thr1, 0)=-2, t1={12784:0}, t2={12783:0}, turn=0, x=0] [L709] 1 flag1 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L793] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, pthread_create(&t2, 0, thr2, 0)=-1, t1={12784:0}, t2={12783:0}, turn=0, x=0] [L750] 2 flag2 = 1 VAL [_={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L712] 1 int f2 = flag2; VAL [_={0:0}, _={0:0}, f2=1, flag1=1, flag2=1, turn=0, x=0] Loop: [L714] COND TRUE f2 >= 1 [L716] int t = turn; [L718] COND FALSE, EXPR !(t != 0) [L735] EXPR f2 = flag2 [L714-L737] { __VERIFIER_atomic_begin(); int t = turn; __VERIFIER_atomic_end(); if (t != 0) { __VERIFIER_atomic_begin(); flag1 = 0; __VERIFIER_atomic_end(); __VERIFIER_atomic_begin(); t = turn; __VERIFIER_atomic_end(); while (t != 0) { __VERIFIER_atomic_begin(); t = turn; __VERIFIER_atomic_end(); }; __VERIFIER_atomic_begin(); flag1 = 1; __VERIFIER_atomic_end(); } __VERIFIER_atomic_begin(); f2 = flag2; __VERIFIER_atomic_end(); } End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-10 00:33:12,949 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...