/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:02:42,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:02:42,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:02:42,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:02:42,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:02:42,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:02:42,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:02:42,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:02:42,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:02:42,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:02:42,220 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:02:42,220 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:02:42,220 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:02:42,220 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:02:42,220 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:02:42,220 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:02:42,220 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:02:42,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:02:42,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:02:42,220 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:02:42,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:02:42,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:02:42,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:02:42,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:02:42,222 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:02:42,222 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:02:42,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:02:42,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:02:42,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:02:42,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:02:42,425 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:02:42,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2025-04-26 16:02:43,699 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b16c3992/b4c0adbff15b457cac46876fd484bfcb/FLAG89b0dfbaa [2025-04-26 16:02:43,962 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:02:43,963 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2025-04-26 16:02:43,979 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b16c3992/b4c0adbff15b457cac46876fd484bfcb/FLAG89b0dfbaa [2025-04-26 16:02:44,749 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5b16c3992/b4c0adbff15b457cac46876fd484bfcb [2025-04-26 16:02:44,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:02:44,752 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:02:44,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:02:44,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:02:44,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:02:44,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:02:44" (1/1) ... [2025-04-26 16:02:44,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5306f2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:44, skipping insertion in model container [2025-04-26 16:02:44,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:02:44" (1/1) ... [2025-04-26 16:02:44,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:02:45,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:02:45,099 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:02:45,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:02:45,191 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:02:45,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45 WrapperNode [2025-04-26 16:02:45,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:02:45,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:02:45,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:02:45,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:02:45,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,231 INFO L138 Inliner]: procedures = 272, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2025-04-26 16:02:45,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:02:45,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:02:45,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:02:45,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:02:45,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:02:45,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:02:45,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:02:45,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:02:45,249 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (1/1) ... [2025-04-26 16:02:45,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:02:45,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:02:45,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:02:45,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:02:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-04-26 16:02:45,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-04-26 16:02:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-26 16:02:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 16:02:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 16:02:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-26 16:02:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 16:02:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:02:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:02:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:02:45,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:02:45,293 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:02:45,379 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:02:45,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:02:45,499 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:02:45,499 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:02:45,513 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:02:45,514 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-26 16:02:45,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:02:45 BoogieIcfgContainer [2025-04-26 16:02:45,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:02:45,515 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:02:45,515 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:02:45,518 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:02:45,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:02:45,519 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:02:44" (1/3) ... [2025-04-26 16:02:45,519 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b580a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:02:45, skipping insertion in model container [2025-04-26 16:02:45,519 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:02:45,519 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:02:45" (2/3) ... [2025-04-26 16:02:45,520 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73b580a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:02:45, skipping insertion in model container [2025-04-26 16:02:45,520 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:02:45,520 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:02:45" (3/3) ... [2025-04-26 16:02:45,520 INFO L376 chiAutomizerObserver]: Analyzing ICFG sssc12_variant.i [2025-04-26 16:02:45,566 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:02:45,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 176 flow [2025-04-26 16:02:45,627 INFO L116 PetriNetUnfolderBase]: 6/95 cut-off events. [2025-04-26 16:02:45,628 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-26 16:02:45,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 95 events. 6/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-04-26 16:02:45,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 86 transitions, 176 flow [2025-04-26 16:02:45,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 86 transitions, 176 flow [2025-04-26 16:02:45,636 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 83 places, 86 transitions, 176 flow [2025-04-26 16:02:45,644 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:02:45,644 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:02:45,644 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:02:45,644 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:02:45,644 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:02:45,644 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:02:45,644 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:02:45,645 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:02:45,646 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:02:45,714 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 237 [2025-04-26 16:02:45,714 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:45,714 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:45,718 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:45,718 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:02:45,719 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:02:45,719 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 473 states, but on-demand construction may add more states [2025-04-26 16:02:45,728 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 237 [2025-04-26 16:02:45,729 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:45,729 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:45,730 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:45,730 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:02:45,738 INFO L752 eck$LassoCheckResult]: Stem: "[153] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[166] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[183] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[202] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[174] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[156] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[127] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[129] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[189] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[162] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[131] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[138] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[175] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[188] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[173] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[120] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[147] L1035-7-->L-1-1: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset]" "[191] 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]" "[193] L-1-2-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_~t~0#1]" "[159] L1054-->L1055: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1]" "[163] L1055-->L1056: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[196] L1056-->L1057: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[161] L1057-->L1057-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[134] L1057-1-->L1057-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet7#1_3|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[~len~0]" "[171] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[152] L1058-->L1058-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, 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]" "[124] L1058-1-->L1020: 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]" "[144] L1020-->L1021: 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]" "[143] L1021-->L1020-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[]" "[201] L1020-1-->L1058-2: 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]" "[195] L1058-2-->L1059: 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]" "[182] L1059-->L1059-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc8#1.base_2| (* (mod v_~len~0_4 1073741824) 4)) |v_#length_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc8#1.base_2| 0)) (= |v_ULTIMATE.start_main_#t~malloc8#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8#1.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc8#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_2|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, #valid, ULTIMATE.start_main_#t~malloc8#1.base, #length]" "[121] L1059-1-->L1059-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_3|, ~data~0.base=v_~data~0.base_2} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[187] L1059-2-->L1060-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_4|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~malloc8#1.base]" "[180] L1060-1-->L1061: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[177] L1061-->L1061-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[148] L1061-1-->L1061-2: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[242] L1061-2-->$Ultimate##0: Formula: (and (= |v_thrThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_thrThread1of1ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thrThread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thrThread1of1ForFork0_~c~0#1=|v_thrThread1of1ForFork0_~c~0#1_22|, thrThread1of1ForFork0_~arg#1.offset=|v_thrThread1of1ForFork0_~arg#1.offset_4|, thrThread1of1ForFork0_~end~0#1=|v_thrThread1of1ForFork0_~end~0#1_14|, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of1ForFork0_~arg#1.base=|v_thrThread1of1ForFork0_~arg#1.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thrThread1of1ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread1of1ForFork0_reach_error_#t~nondet3#1.base_6|, thrThread1of1ForFork0_#in~arg#1.base=|v_thrThread1of1ForFork0_#in~arg#1.base_4|, thrThread1of1ForFork0_thidvar0=v_thrThread1of1ForFork0_thidvar0_2, thrThread1of1ForFork0_#t~ret4#1=|v_thrThread1of1ForFork0_#t~ret4#1_6|, thrThread1of1ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread1of1ForFork0_reach_error_#t~nondet3#1.offset_6|, thrThread1of1ForFork0_#res#1.offset=|v_thrThread1of1ForFork0_#res#1.offset_4|, thrThread1of1ForFork0_thidvar1=v_thrThread1of1ForFork0_thidvar1_2, thrThread1of1ForFork0_#t~mem6#1=|v_thrThread1of1ForFork0_#t~mem6#1_8|, thrThread1of1ForFork0_#in~arg#1.offset=|v_thrThread1of1ForFork0_#in~arg#1.offset_4|, thrThread1of1ForFork0_#t~ret5#1=|v_thrThread1of1ForFork0_#t~ret5#1_6|, thrThread1of1ForFork0_#res#1.base=|v_thrThread1of1ForFork0_#res#1.base_4|, thrThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of1ForFork0___VERIFIER_assert_~cond#1_12|} AuxVars[] AssignedVars[thrThread1of1ForFork0_~c~0#1, thrThread1of1ForFork0_~arg#1.offset, thrThread1of1ForFork0_~end~0#1, thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of1ForFork0_~arg#1.base, thrThread1of1ForFork0_reach_error_#t~nondet3#1.base, thrThread1of1ForFork0_#in~arg#1.base, thrThread1of1ForFork0_thidvar0, thrThread1of1ForFork0_#t~ret4#1, thrThread1of1ForFork0_reach_error_#t~nondet3#1.offset, thrThread1of1ForFork0_#res#1.offset, thrThread1of1ForFork0_thidvar1, thrThread1of1ForFork0_#t~mem6#1, thrThread1of1ForFork0_#in~arg#1.offset, thrThread1of1ForFork0_#t~ret5#1, thrThread1of1ForFork0_#res#1.base, thrThread1of1ForFork0___VERIFIER_assert_~cond#1]" "[146] L1061-3-->L1061-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[130] L1061-4-->L1060-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[180] L1060-1-->L1061: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[177] L1061-->L1061-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[148] L1061-1-->L1061-2: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[240] L1061-2-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:02:45,738 INFO L754 eck$LassoCheckResult]: Loop: "[241] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:02:45,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2076039143, now seen corresponding path program 1 times [2025-04-26 16:02:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:45,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592696522] [2025-04-26 16:02:45,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:45,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 16:02:45,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 16:02:45,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:45,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:45,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:45,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 16:02:45,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 16:02:45,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:45,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:45,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:45,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash 272, now seen corresponding path program 1 times [2025-04-26 16:02:45,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:45,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66982226] [2025-04-26 16:02:45,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:45,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:45,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:45,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:45,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:45,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:45,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:45,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:45,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:45,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:45,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:45,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:45,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 67296248, now seen corresponding path program 1 times [2025-04-26 16:02:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:45,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029300690] [2025-04-26 16:02:45,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:45,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-26 16:02:45,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-26 16:02:45,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:45,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:45,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:45,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-26 16:02:45,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-26 16:02:45,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:45,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:45,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:46,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 16:02:46,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 16:02:46,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:46,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:46,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:46,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-26 16:02:46,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-26 16:02:46,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:46,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:46,581 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:02:46,606 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:02:46,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 123 transitions, 256 flow [2025-04-26 16:02:46,629 INFO L116 PetriNetUnfolderBase]: 10/143 cut-off events. [2025-04-26 16:02:46,630 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:02:46,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 143 events. 10/143 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 244 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 95. Up to 3 conditions per place. [2025-04-26 16:02:46,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 123 transitions, 256 flow [2025-04-26 16:02:46,632 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 123 transitions, 256 flow [2025-04-26 16:02:46,632 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 118 places, 123 transitions, 256 flow [2025-04-26 16:02:46,633 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:02:46,633 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:02:46,633 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:02:46,633 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:02:46,633 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:02:46,633 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:02:46,633 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:02:46,633 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:02:46,633 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:02:47,249 INFO L131 ngComponentsAnalysis]: Automaton has 697 accepting balls. 11289 [2025-04-26 16:02:47,250 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:47,250 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:47,251 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:47,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:47,251 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:02:47,251 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 14597 states, but on-demand construction may add more states [2025-04-26 16:02:47,436 INFO L131 ngComponentsAnalysis]: Automaton has 697 accepting balls. 11289 [2025-04-26 16:02:47,436 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:47,437 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:47,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:47,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:47,439 INFO L752 eck$LassoCheckResult]: Stem: "[276] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[289] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[306] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[325] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[297] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[279] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[250] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[252] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[312] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[285] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[254] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[261] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[298] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[311] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[296] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[243] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[270] L1035-7-->L-1-1: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset]" "[314] 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]" "[316] L-1-2-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_~t~0#1]" "[282] L1054-->L1055: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1]" "[286] L1055-->L1056: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[319] L1056-->L1057: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[284] L1057-->L1057-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[257] L1057-1-->L1057-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet7#1_3|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[~len~0]" "[294] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[275] L1058-->L1058-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, 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]" "[247] L1058-1-->L1020: 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]" "[267] L1020-->L1021: 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]" "[266] L1021-->L1020-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[]" "[324] L1020-1-->L1058-2: 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]" "[318] L1058-2-->L1059: 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]" "[305] L1059-->L1059-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc8#1.base_2| (* (mod v_~len~0_4 1073741824) 4)) |v_#length_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc8#1.base_2| 0)) (= |v_ULTIMATE.start_main_#t~malloc8#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8#1.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc8#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_2|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, #valid, ULTIMATE.start_main_#t~malloc8#1.base, #length]" "[244] L1059-1-->L1059-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_3|, ~data~0.base=v_~data~0.base_2} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[310] L1059-2-->L1060-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_4|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~malloc8#1.base]" "[303] L1060-1-->L1061: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[300] L1061-->L1061-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[271] L1061-1-->L1061-2: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[401] L1061-2-->$Ultimate##0: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_13| v_thrThread1of2ForFork0_thidvar0_2) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_13|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread1of2ForFork0_reach_error_#t~nondet3#1.base_6|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_13|, thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_6|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_22|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread1of2ForFork0_reach_error_#t~nondet3#1.offset_6|, thrThread1of2ForFork0_#t~mem6#1=|v_thrThread1of2ForFork0_#t~mem6#1_8|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_reach_error_#t~nondet3#1.base, thrThread1of2ForFork0_#t~ret4#1, thrThread1of2ForFork0_#t~ret5#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_reach_error_#t~nondet3#1.offset, thrThread1of2ForFork0_#t~mem6#1, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_#in~arg#1.offset]" "[363] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of2ForFork0_~arg#1.base_1| |v_thrThread1of2ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of2ForFork0_~arg#1.offset_1| |v_thrThread1of2ForFork0_#in~arg#1.offset_1|)) InVars {thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} OutVars{thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_1|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_1|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_1|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_~arg#1.base]" "[364] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[365] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[366] L1038-->L1039: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" "[367] L1039-->L1040: Formula: (= |v_thrThread1of2ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~end~0#1]" "[368] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|))) (and (= |v_thrThread1of2ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store .cse0 |v_~#lock~0.offset_11| 1))) (= (select .cse0 |v_~#lock~0.offset_11|) 0))) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of2ForFork0_#t~ret4#1]" "[369] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~ret4#1]" "[371] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[373] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of2ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of2ForFork0_#t~ret5#1]" "[375] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~ret5#1]" [2025-04-26 16:02:47,440 INFO L754 eck$LassoCheckResult]: Loop: "[378] L1046-1-->L1047: Formula: (< |v_thrThread1of2ForFork0_~c~0#1_9| |v_thrThread1of2ForFork0_~end~0#1_11|) InVars {thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} OutVars{thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_11|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[]" "[380] L1047-->L1047-1: Formula: (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_11| 4))) (let ((.cse0 (+ v_~data~0.offset_3 .cse1))) (and (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse0 0)) |v_#memory_int_8|) (<= 0 .cse0) (= (select |v_#valid_7| v_~data~0.base_3) 1) (<= (+ v_~data~0.offset_3 4 .cse1) (select |v_#length_6| v_~data~0.base_3))))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_11|} AuxVars[] AssignedVars[#memory_int]" "[382] L1047-1-->L1048: Formula: (let ((.cse0 (* |v_thrThread1of2ForFork0_~c~0#1_13| 4))) (let ((.cse1 (+ v_~data~0.offset_4 .cse0))) (and (<= (+ v_~data~0.offset_4 .cse0 4) (select |v_#length_7| v_~data~0.base_4)) (= (select |v_#valid_8| v_~data~0.base_4) 1) (= (store |v_#memory_int_11| v_~data~0.base_4 (store (select |v_#memory_int_11| v_~data~0.base_4) .cse1 1)) |v_#memory_int_10|) (<= 0 .cse1)))) InVars {#memory_int=|v_#memory_int_11|, ~data~0.offset=v_~data~0.offset_4, #length=|v_#length_7|, ~data~0.base=v_~data~0.base_4, #valid=|v_#valid_8|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} OutVars{#memory_int=|v_#memory_int_10|, ~data~0.offset=v_~data~0.offset_4, #length=|v_#length_7|, ~data~0.base=v_~data~0.base_4, #valid=|v_#valid_8|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_13|} AuxVars[] AssignedVars[#memory_int]" "[383] L1048-->L1049: Formula: (let ((.cse1 (* |v_thrThread1of2ForFork0_~c~0#1_15| 4))) (let ((.cse0 (+ v_~data~0.offset_5 .cse1))) (and (= (select |v_#valid_9| v_~data~0.base_5) 1) (= (select (select |v_#memory_int_12| v_~data~0.base_5) .cse0) |v_thrThread1of2ForFork0_#t~mem6#1_1|) (<= 0 .cse0) (<= (+ v_~data~0.offset_5 .cse1 4) (select |v_#length_8| v_~data~0.base_5))))) InVars {~data~0.offset=v_~data~0.offset_5, #memory_int=|v_#memory_int_12|, #length=|v_#length_8|, ~data~0.base=v_~data~0.base_5, #valid=|v_#valid_9|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_15|} OutVars{~data~0.base=v_~data~0.base_5, thrThread1of2ForFork0_#t~mem6#1=|v_thrThread1of2ForFork0_#t~mem6#1_1|, #valid=|v_#valid_9|, ~data~0.offset=v_~data~0.offset_5, #memory_int=|v_#memory_int_12|, #length=|v_#length_8|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_15|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~mem6#1]" "[384] L1049-->L1049-1: Formula: (= (ite (= |v_thrThread1of2ForFork0_#t~mem6#1_3| 1) 1 0) |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of2ForFork0_#t~mem6#1=|v_thrThread1of2ForFork0_#t~mem6#1_3|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_1|, thrThread1of2ForFork0_#t~mem6#1=|v_thrThread1of2ForFork0_#t~mem6#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1]" "[385] L1049-1-->L1023: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[386] L1023-->L1024: Formula: (= |v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3| |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|) InVars {thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_3|, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[388] L1024-->L1024-2: Formula: (not (= |v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[390] L1024-2-->L1049-2: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_~cond#1]" "[393] L1049-2-->L1049-3: Formula: true InVars {} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1]" "[396] L1049-3-->L1050: Formula: true InVars {} OutVars{thrThread1of2ForFork0_#t~mem6#1=|v_thrThread1of2ForFork0_#t~mem6#1_5|} AuxVars[] AssignedVars[thrThread1of2ForFork0_#t~mem6#1]" "[398] L1050-->L1046-1: Formula: (= |v_thrThread1of2ForFork0_~c~0#1_18| (+ |v_thrThread1of2ForFork0_~c~0#1_17| 1)) InVars {thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_17|} OutVars{thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_18|} AuxVars[] AssignedVars[thrThread1of2ForFork0_~c~0#1]" [2025-04-26 16:02:47,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash 598031867, now seen corresponding path program 1 times [2025-04-26 16:02:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:47,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25926212] [2025-04-26 16:02:47,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:47,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:47,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 16:02:47,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 16:02:47,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:47,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:47,474 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:47,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 16:02:47,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 16:02:47,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:47,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:47,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:47,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1358474740, now seen corresponding path program 1 times [2025-04-26 16:02:47,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:47,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824283658] [2025-04-26 16:02:47,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:47,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:02:47,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:02:47,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:47,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:47,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:47,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:02:47,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:02:47,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:47,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:47,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:47,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1481807610, now seen corresponding path program 1 times [2025-04-26 16:02:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:47,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556135511] [2025-04-26 16:02:47,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:47,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:47,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 16:02:47,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 16:02:47,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:47,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:02:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:02:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:02:47,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556135511] [2025-04-26 16:02:47,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556135511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:02:47,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:02:47,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:02:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230096792] [2025-04-26 16:02:47,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:02:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:02:47,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:02:47,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:02:47,806 INFO L87 Difference]: Start difference. First operand currently 14597 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 15.0) internal successors, (in total 60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:02:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:02:47,971 INFO L93 Difference]: Finished difference Result 8290 states and 24829 transitions. [2025-04-26 16:02:47,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8290 states and 24829 transitions. [2025-04-26 16:02:48,055 INFO L131 ngComponentsAnalysis]: Automaton has 796 accepting balls. 5251 [2025-04-26 16:02:48,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8290 states to 8289 states and 24828 transitions. [2025-04-26 16:02:48,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8289 [2025-04-26 16:02:48,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8289 [2025-04-26 16:02:48,206 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8289 states and 24828 transitions. [2025-04-26 16:02:48,234 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:02:48,234 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8289 states and 24828 transitions. [2025-04-26 16:02:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8289 states and 24828 transitions. [2025-04-26 16:02:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8289 to 7620. [2025-04-26 16:02:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 7620 states have (on average 3.023753280839895) internal successors, (in total 23041), 7619 states have internal predecessors, (23041), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:02:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 23041 transitions. [2025-04-26 16:02:48,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7620 states and 23041 transitions. [2025-04-26 16:02:48,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:02:48,462 INFO L438 stractBuchiCegarLoop]: Abstraction has 7620 states and 23041 transitions. [2025-04-26 16:02:48,462 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:02:48,462 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7620 states and 23041 transitions. [2025-04-26 16:02:48,499 INFO L131 ngComponentsAnalysis]: Automaton has 718 accepting balls. 4942 [2025-04-26 16:02:48,499 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:02:48,499 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:02:48,502 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:02:48,502 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:02:48,505 INFO L752 eck$LassoCheckResult]: Stem: "[276] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[289] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[306] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[325] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[297] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[279] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[250] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[252] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[312] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[285] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[254] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[261] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[298] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[311] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[296] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[243] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[270] L1035-7-->L-1-1: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset]" "[314] 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]" "[316] L-1-2-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_~t~0#1]" "[282] L1054-->L1055: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1]" "[286] L1055-->L1056: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[319] L1056-->L1057: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[284] L1057-->L1057-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[257] L1057-1-->L1057-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet7#1_3|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[~len~0]" "[294] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[275] L1058-->L1058-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, 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]" "[247] L1058-1-->L1020: 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]" "[267] L1020-->L1021: 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]" "[266] L1021-->L1020-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[]" "[324] L1020-1-->L1058-2: 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]" "[318] L1058-2-->L1059: 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]" "[305] L1059-->L1059-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc8#1.base_2| (* (mod v_~len~0_4 1073741824) 4)) |v_#length_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc8#1.base_2| 0)) (= |v_ULTIMATE.start_main_#t~malloc8#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8#1.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc8#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_2|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, #valid, ULTIMATE.start_main_#t~malloc8#1.base, #length]" "[244] L1059-1-->L1059-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_3|, ~data~0.base=v_~data~0.base_2} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[310] L1059-2-->L1060-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_4|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~malloc8#1.base]" "[303] L1060-1-->L1061: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[300] L1061-->L1061-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[271] L1061-1-->L1061-2: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[401] L1061-2-->$Ultimate##0: Formula: (and (= v_thrThread1of2ForFork0_thidvar1_2 0) (= |v_thrThread1of2ForFork0_#in~arg#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_13| v_thrThread1of2ForFork0_thidvar0_2) (= |v_thrThread1of2ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_13|} OutVars{thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of2ForFork0_~arg#1.offset=|v_thrThread1of2ForFork0_~arg#1.offset_4|, thrThread1of2ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread1of2ForFork0_reach_error_#t~nondet3#1.base_6|, thrThread1of2ForFork0_#t~ret4#1=|v_thrThread1of2ForFork0_#t~ret4#1_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_13|, thrThread1of2ForFork0_#t~ret5#1=|v_thrThread1of2ForFork0_#t~ret5#1_6|, thrThread1of2ForFork0_~c~0#1=|v_thrThread1of2ForFork0_~c~0#1_22|, thrThread1of2ForFork0_#in~arg#1.base=|v_thrThread1of2ForFork0_#in~arg#1.base_4|, thrThread1of2ForFork0_#res#1.offset=|v_thrThread1of2ForFork0_#res#1.offset_4|, thrThread1of2ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread1of2ForFork0_reach_error_#t~nondet3#1.offset_6|, thrThread1of2ForFork0_#t~mem6#1=|v_thrThread1of2ForFork0_#t~mem6#1_8|, thrThread1of2ForFork0_thidvar1=v_thrThread1of2ForFork0_thidvar1_2, thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_2, thrThread1of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of2ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of2ForFork0_#res#1.base=|v_thrThread1of2ForFork0_#res#1.base_4|, thrThread1of2ForFork0_~arg#1.base=|v_thrThread1of2ForFork0_~arg#1.base_4|, thrThread1of2ForFork0_~end~0#1=|v_thrThread1of2ForFork0_~end~0#1_14|, thrThread1of2ForFork0_#in~arg#1.offset=|v_thrThread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of2ForFork0_~arg#1.offset, thrThread1of2ForFork0_reach_error_#t~nondet3#1.base, thrThread1of2ForFork0_#t~ret4#1, thrThread1of2ForFork0_#t~ret5#1, thrThread1of2ForFork0_~c~0#1, thrThread1of2ForFork0_#in~arg#1.base, thrThread1of2ForFork0_#res#1.offset, thrThread1of2ForFork0_reach_error_#t~nondet3#1.offset, thrThread1of2ForFork0_#t~mem6#1, thrThread1of2ForFork0_thidvar1, thrThread1of2ForFork0_thidvar0, thrThread1of2ForFork0___VERIFIER_assert_~cond#1, thrThread1of2ForFork0_#res#1.base, thrThread1of2ForFork0_~arg#1.base, thrThread1of2ForFork0_~end~0#1, thrThread1of2ForFork0_#in~arg#1.offset]" "[269] L1061-3-->L1061-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[253] L1061-4-->L1060-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[303] L1060-1-->L1061: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[300] L1061-->L1061-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[271] L1061-1-->L1061-2: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[402] L1061-2-->$Ultimate##0: Formula: (and (= v_thrThread2of2ForFork0_thidvar1_2 0) (= |v_thrThread2of2ForFork0_#in~arg#1.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre9#1_15| v_thrThread2of2ForFork0_thidvar0_2) (= |v_thrThread2of2ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|} OutVars{thrThread2of2ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread2of2ForFork0_reach_error_#t~nondet3#1.offset_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_15|, thrThread2of2ForFork0_thidvar1=v_thrThread2of2ForFork0_thidvar1_2, thrThread2of2ForFork0_#t~ret5#1=|v_thrThread2of2ForFork0_#t~ret5#1_6|, thrThread2of2ForFork0___VERIFIER_assert_~cond#1=|v_thrThread2of2ForFork0___VERIFIER_assert_~cond#1_12|, thrThread2of2ForFork0_#in~arg#1.offset=|v_thrThread2of2ForFork0_#in~arg#1.offset_4|, thrThread2of2ForFork0_~end~0#1=|v_thrThread2of2ForFork0_~end~0#1_14|, thrThread2of2ForFork0_#res#1.base=|v_thrThread2of2ForFork0_#res#1.base_4|, thrThread2of2ForFork0_~arg#1.base=|v_thrThread2of2ForFork0_~arg#1.base_4|, thrThread2of2ForFork0_~arg#1.offset=|v_thrThread2of2ForFork0_~arg#1.offset_4|, thrThread2of2ForFork0_#res#1.offset=|v_thrThread2of2ForFork0_#res#1.offset_4|, thrThread2of2ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread2of2ForFork0_reach_error_#t~nondet3#1.base_6|, thrThread2of2ForFork0_#t~ret4#1=|v_thrThread2of2ForFork0_#t~ret4#1_6|, thrThread2of2ForFork0_thidvar0=v_thrThread2of2ForFork0_thidvar0_2, thrThread2of2ForFork0_#t~mem6#1=|v_thrThread2of2ForFork0_#t~mem6#1_8|, thrThread2of2ForFork0_~c~0#1=|v_thrThread2of2ForFork0_~c~0#1_22|, thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread2of2ForFork0_#in~arg#1.base=|v_thrThread2of2ForFork0_#in~arg#1.base_4|} AuxVars[] AssignedVars[thrThread2of2ForFork0_reach_error_#t~nondet3#1.offset, thrThread2of2ForFork0_thidvar1, thrThread2of2ForFork0_#t~ret5#1, thrThread2of2ForFork0___VERIFIER_assert_~cond#1, thrThread2of2ForFork0_#in~arg#1.offset, thrThread2of2ForFork0_~end~0#1, thrThread2of2ForFork0_#res#1.base, thrThread2of2ForFork0_~arg#1.base, thrThread2of2ForFork0_~arg#1.offset, thrThread2of2ForFork0_#res#1.offset, thrThread2of2ForFork0_reach_error_#t~nondet3#1.base, thrThread2of2ForFork0_#t~ret4#1, thrThread2of2ForFork0_thidvar0, thrThread2of2ForFork0_#t~mem6#1, thrThread2of2ForFork0_~c~0#1, thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1, thrThread2of2ForFork0_#in~arg#1.base]" "[269] L1061-3-->L1061-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[253] L1061-4-->L1060-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[303] L1060-1-->L1061: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[300] L1061-->L1061-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[271] L1061-1-->L1061-2: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[399] L1061-2-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:02:48,505 INFO L754 eck$LassoCheckResult]: Loop: "[400] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:02:48,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:48,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1784298289, now seen corresponding path program 1 times [2025-04-26 16:02:48,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:48,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883156177] [2025-04-26 16:02:48,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:48,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:48,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:02:48,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:02:48,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:48,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:48,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:48,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:02:48,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:02:48,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:48,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:48,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:48,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash 431, now seen corresponding path program 1 times [2025-04-26 16:02:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:48,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987283082] [2025-04-26 16:02:48,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:48,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:48,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:48,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:48,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:48,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:48,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:02:48,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:02:48,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:48,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:48,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:48,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:02:48,543 INFO L85 PathProgramCache]: Analyzing trace with hash -521327489, now seen corresponding path program 1 times [2025-04-26 16:02:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:02:48,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554650418] [2025-04-26 16:02:48,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:02:48,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:02:48,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 16:02:48,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 16:02:48,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:48,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:48,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:48,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-26 16:02:48,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-26 16:02:48,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:48,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:48,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:02:49,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:02:49,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:02:49,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:49,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:49,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:02:49,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:02:49,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:02:49,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:02:49,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:02:49,162 WARN L166 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:02:49,187 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:02:49,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 160 transitions, 338 flow [2025-04-26 16:02:49,214 INFO L116 PetriNetUnfolderBase]: 14/191 cut-off events. [2025-04-26 16:02:49,214 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 16:02:49,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 14/191 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 465 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 146. Up to 4 conditions per place. [2025-04-26 16:02:49,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 160 transitions, 338 flow [2025-04-26 16:02:49,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 160 transitions, 338 flow [2025-04-26 16:02:49,220 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 153 places, 160 transitions, 338 flow [2025-04-26 16:02:49,221 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:02:49,221 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:02:49,221 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:02:49,221 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:02:49,221 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:02:49,221 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:02:49,221 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:02:49,221 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:02:49,221 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:03:11,319 INFO L131 ngComponentsAnalysis]: Automaton has 15125 accepting balls. 428229 [2025-04-26 16:03:11,319 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:03:11,319 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:03:11,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:03:11,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:03:11,325 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:03:11,325 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 480689 states, but on-demand construction may add more states [2025-04-26 16:03:20,295 INFO L131 ngComponentsAnalysis]: Automaton has 15125 accepting balls. 428229 [2025-04-26 16:03:20,296 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:03:20,296 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:03:20,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:03:20,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:03:20,305 INFO L752 eck$LassoCheckResult]: Stem: "[436] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[449] L-1-->L1018: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[466] L1018-->L1018-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[485] L1018-1-->L1018-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[]" "[457] L1018-2-->L1018-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[]" "[439] L1018-3-->L1018-4: Formula: (and (= 9 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[]" "[410] L1018-4-->L1033: Formula: (and (= v_~data~0.base_1 0) (= v_~data~0.offset_1 0)) InVars {} OutVars{~data~0.offset=v_~data~0.offset_1, ~data~0.base=v_~data~0.base_1} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[412] L1033-->L1034: Formula: (= v_~len~0_1 0) InVars {} OutVars{~len~0=v_~len~0_1} AuxVars[] AssignedVars[~len~0]" "[472] L1034-->L1035: Formula: (= v_~next~0_1 0) InVars {} OutVars{~next~0=v_~next~0_1} AuxVars[] AssignedVars[~next~0]" "[445] L1035-->L1035-1: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[]" "[414] L1035-1-->L1035-2: Formula: (and (= 3 |v_~#lock~0.base_1|) (= |v_~#lock~0.offset_1| 0)) InVars {} OutVars{~#lock~0.base=|v_~#lock~0.base_1|, ~#lock~0.offset=|v_~#lock~0.offset_1|} AuxVars[] AssignedVars[~#lock~0.base, ~#lock~0.offset]" "[421] L1035-2-->L1035-3: Formula: (= 0 (select (select |v_#memory_int_3| |v_~#lock~0.base_2|) |v_~#lock~0.offset_2|)) InVars {~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} OutVars{~#lock~0.base=|v_~#lock~0.base_2|, #memory_int=|v_#memory_int_3|, ~#lock~0.offset=|v_~#lock~0.offset_2|} AuxVars[] AssignedVars[]" "[458] L1035-3-->L1035-4: Formula: (= (select (select |v_#memory_int_4| |v_~#lock~0.base_3|) (+ |v_~#lock~0.offset_3| 4)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} OutVars{~#lock~0.base=|v_~#lock~0.base_3|, #memory_int=|v_#memory_int_4|, ~#lock~0.offset=|v_~#lock~0.offset_3|} AuxVars[] AssignedVars[]" "[471] L1035-4-->L1035-5: Formula: (= (select (select |v_#memory_int_5| |v_~#lock~0.base_4|) (+ |v_~#lock~0.offset_4| 8)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} OutVars{~#lock~0.base=|v_~#lock~0.base_4|, #memory_int=|v_#memory_int_5|, ~#lock~0.offset=|v_~#lock~0.offset_4|} AuxVars[] AssignedVars[]" "[456] L1035-5-->L1035-6: Formula: (= (select (select |v_#memory_int_6| |v_~#lock~0.base_5|) (+ |v_~#lock~0.offset_5| 12)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} OutVars{~#lock~0.base=|v_~#lock~0.base_5|, #memory_int=|v_#memory_int_6|, ~#lock~0.offset=|v_~#lock~0.offset_5|} AuxVars[] AssignedVars[]" "[403] L1035-6-->L1035-7: Formula: (= (select (select |v_#memory_int_7| |v_~#lock~0.base_6|) (+ 16 |v_~#lock~0.offset_6|)) 0) InVars {~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} OutVars{~#lock~0.base=|v_~#lock~0.base_6|, #memory_int=|v_#memory_int_7|, ~#lock~0.offset=|v_~#lock~0.offset_6|} AuxVars[] AssignedVars[]" "[430] L1035-7-->L-1-1: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset]" "[474] 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]" "[476] L-1-2-->L1054: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_1|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~malloc8#1.base, ULTIMATE.start_main_~t~0#1]" "[442] L1054-->L1055: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1]" "[446] L1055-->L1056: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[479] L1056-->L1057: Formula: (= v_~next~0_2 0) InVars {} OutVars{~next~0=v_~next~0_2} AuxVars[] AssignedVars[~next~0]" "[444] L1057-->L1057-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[417] L1057-1-->L1057-2: Formula: (= v_~len~0_2 |v_ULTIMATE.start_main_#t~nondet7#1_3|) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{~len~0=v_~len~0_2, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[~len~0]" "[454] L1057-2-->L1058: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[435] L1058-->L1058-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< v_~len~0_3 1073741824) (< 0 v_~len~0_3)) 1 0)) InVars {~len~0=v_~len~0_3} OutVars{~len~0=v_~len~0_3, 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]" "[407] L1058-1-->L1020: 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]" "[427] L1020-->L1021: 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]" "[426] L1021-->L1020-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[]" "[484] L1020-1-->L1058-2: 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]" "[478] L1058-2-->L1059: 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]" "[465] L1059-->L1059-1: Formula: (and (= (store |v_#length_5| |v_ULTIMATE.start_main_#t~malloc8#1.base_2| (* (mod v_~len~0_4 1073741824) 4)) |v_#length_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8#1.base_2|) 0) (not (= |v_ULTIMATE.start_main_#t~malloc8#1.base_2| 0)) (= |v_ULTIMATE.start_main_#t~malloc8#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc8#1.base_2| 1)) (< |v_ULTIMATE.start_main_#t~malloc8#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|, ~len~0=v_~len~0_4} OutVars{ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_2|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|, ~len~0=v_~len~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, #valid, ULTIMATE.start_main_#t~malloc8#1.base, #length]" "[404] L1059-1-->L1059-2: Formula: (and (= v_~data~0.offset_2 |v_ULTIMATE.start_main_#t~malloc8#1.offset_3|) (= |v_ULTIMATE.start_main_#t~malloc8#1.base_3| v_~data~0.base_2)) InVars {ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_3|} OutVars{~data~0.offset=v_~data~0.offset_2, ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_3|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_3|, ~data~0.base=v_~data~0.base_2} AuxVars[] AssignedVars[~data~0.base, ~data~0.offset]" "[470] L1059-2-->L1060-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~malloc8#1.base=|v_ULTIMATE.start_main_#t~malloc8#1.base_4|, ULTIMATE.start_main_#t~malloc8#1.offset=|v_ULTIMATE.start_main_#t~malloc8#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc8#1.offset, ULTIMATE.start_main_#t~malloc8#1.base]" "[463] L1060-1-->L1061: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[460] L1061-->L1061-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[431] L1061-1-->L1061-2: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~t~0#1=|v_ULTIMATE.start_main_~t~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t~0#1]" "[597] L1061-2-->$Ultimate##0: Formula: (and (= v_thrThread1of3ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre9#1_23| v_thrThread1of3ForFork0_thidvar0_2) (= |v_thrThread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|} OutVars{thrThread1of3ForFork0_reach_error_#t~nondet3#1.base=|v_thrThread1of3ForFork0_reach_error_#t~nondet3#1.base_6|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_8|, thrThread1of3ForFork0_#res#1.base=|v_thrThread1of3ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_23|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_22|, thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_12|, thrThread1of3ForFork0_#t~mem6#1=|v_thrThread1of3ForFork0_#t~mem6#1_8|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_6|, thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_4|, thrThread1of3ForFork0_#res#1.offset=|v_thrThread1of3ForFork0_#res#1.offset_4|, thrThread1of3ForFork0_reach_error_#t~nondet3#1.offset=|v_thrThread1of3ForFork0_reach_error_#t~nondet3#1.offset_6|, thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_14|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_4|, thrThread1of3ForFork0_thidvar0=v_thrThread1of3ForFork0_thidvar0_2, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_6|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_4|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_4|, thrThread1of3ForFork0_thidvar1=v_thrThread1of3ForFork0_thidvar1_2} AuxVars[] AssignedVars[thrThread1of3ForFork0_reach_error_#t~nondet3#1.base, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1, thrThread1of3ForFork0_#res#1.base, thrThread1of3ForFork0_~c~0#1, thrThread1of3ForFork0___VERIFIER_assert_~cond#1, thrThread1of3ForFork0_#t~mem6#1, thrThread1of3ForFork0_#t~ret5#1, thrThread1of3ForFork0_#in~arg#1.base, thrThread1of3ForFork0_#res#1.offset, thrThread1of3ForFork0_reach_error_#t~nondet3#1.offset, thrThread1of3ForFork0_~end~0#1, thrThread1of3ForFork0_#in~arg#1.offset, thrThread1of3ForFork0_thidvar0, thrThread1of3ForFork0_#t~ret4#1, thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset, thrThread1of3ForFork0_thidvar1]" "[487] $Ultimate##0-->L1037: Formula: (and (= |v_thrThread1of3ForFork0_~arg#1.base_1| |v_thrThread1of3ForFork0_#in~arg#1.base_1|) (= |v_thrThread1of3ForFork0_#in~arg#1.offset_1| |v_thrThread1of3ForFork0_~arg#1.offset_1|)) InVars {thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|} OutVars{thrThread1of3ForFork0_#in~arg#1.base=|v_thrThread1of3ForFork0_#in~arg#1.base_1|, thrThread1of3ForFork0_#in~arg#1.offset=|v_thrThread1of3ForFork0_#in~arg#1.offset_1|, thrThread1of3ForFork0_~arg#1.base=|v_thrThread1of3ForFork0_~arg#1.base_1|, thrThread1of3ForFork0_~arg#1.offset=|v_thrThread1of3ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~arg#1.base, thrThread1of3ForFork0_~arg#1.offset]" "[488] L1037-->L1037-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[489] L1037-1-->L1038: Formula: true InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[490] L1038-->L1039: Formula: (= |v_thrThread1of3ForFork0_~c~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" "[491] L1039-->L1040: Formula: (= |v_thrThread1of3ForFork0_~end~0#1_3| 0) InVars {} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~end~0#1]" "[492] L1040-->L1040-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#lock~0.base_11|))) (and (= |v_thrThread1of3ForFork0_#t~ret4#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#lock~0.base_11| (store .cse0 |v_~#lock~0.offset_11| 1))) (= (select .cse0 |v_~#lock~0.offset_11|) 0))) InVars {~#lock~0.base=|v_~#lock~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#lock~0.offset=|v_~#lock~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#lock~0.offset=|v_~#lock~0.offset_11|, ~#lock~0.base=|v_~#lock~0.base_11|, thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret4#1]" "[493] L1040-3-->L1041: Formula: true InVars {} OutVars{thrThread1of3ForFork0_#t~ret4#1=|v_thrThread1of3ForFork0_#t~ret4#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~ret4#1]" "[495] L1041-->L1041-2: Formula: (< v_~len~0_6 (+ v_~next~0_7 10)) InVars {~next~0=v_~next~0_7, ~len~0=v_~len~0_6} OutVars{~next~0=v_~next~0_7, ~len~0=v_~len~0_6} AuxVars[] AssignedVars[]" "[497] L1041-2-->L1045-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#lock~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#lock~0.base_15|) |v_~#lock~0.offset_15| 0))) (= |v_thrThread1of3ForFork0_#t~ret5#1_1| 0)) InVars {~#lock~0.base=|v_~#lock~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#lock~0.offset=|v_~#lock~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#lock~0.offset=|v_~#lock~0.offset_15|, ~#lock~0.base=|v_~#lock~0.base_15|, thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thrThread1of3ForFork0_#t~ret5#1]" "[499] L1045-2-->L1046-1: Formula: true InVars {} OutVars{thrThread1of3ForFork0_#t~ret5#1=|v_thrThread1of3ForFork0_#t~ret5#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~ret5#1]" [2025-04-26 16:03:20,310 INFO L754 eck$LassoCheckResult]: Loop: "[502] L1046-1-->L1047: Formula: (< |v_thrThread1of3ForFork0_~c~0#1_9| |v_thrThread1of3ForFork0_~end~0#1_11|) InVars {thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} OutVars{thrThread1of3ForFork0_~end~0#1=|v_thrThread1of3ForFork0_~end~0#1_11|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_9|} AuxVars[] AssignedVars[]" "[504] L1047-->L1047-1: Formula: (let ((.cse0 (* |v_thrThread1of3ForFork0_~c~0#1_11| 4))) (let ((.cse1 (+ v_~data~0.offset_3 .cse0))) (and (<= (+ v_~data~0.offset_3 4 .cse0) (select |v_#length_6| v_~data~0.base_3)) (= (select |v_#valid_7| v_~data~0.base_3) 1) (= (store |v_#memory_int_9| v_~data~0.base_3 (store (select |v_#memory_int_9| v_~data~0.base_3) .cse1 0)) |v_#memory_int_8|) (<= 0 .cse1)))) InVars {#memory_int=|v_#memory_int_9|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} OutVars{#memory_int=|v_#memory_int_8|, ~data~0.offset=v_~data~0.offset_3, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_11|, #length=|v_#length_6|, ~data~0.base=v_~data~0.base_3, #valid=|v_#valid_7|} AuxVars[] AssignedVars[#memory_int]" "[506] L1047-1-->L1048: Formula: (let ((.cse0 (* |v_thrThread1of3ForFork0_~c~0#1_13| 4))) (let ((.cse1 (+ v_~data~0.offset_4 .cse0))) (and (= (select |v_#valid_8| v_~data~0.base_4) 1) (<= (+ v_~data~0.offset_4 .cse0 4) (select |v_#length_7| v_~data~0.base_4)) (<= 0 .cse1) (= |v_#memory_int_10| (store |v_#memory_int_11| v_~data~0.base_4 (store (select |v_#memory_int_11| v_~data~0.base_4) .cse1 1)))))) InVars {#memory_int=|v_#memory_int_11|, ~data~0.offset=v_~data~0.offset_4, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_7|, ~data~0.base=v_~data~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_10|, ~data~0.offset=v_~data~0.offset_4, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_13|, #length=|v_#length_7|, ~data~0.base=v_~data~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int]" "[507] L1048-->L1049: Formula: (let ((.cse1 (* |v_thrThread1of3ForFork0_~c~0#1_15| 4))) (let ((.cse0 (+ .cse1 v_~data~0.offset_5))) (and (= (select |v_#valid_9| v_~data~0.base_5) 1) (= (select (select |v_#memory_int_12| v_~data~0.base_5) .cse0) |v_thrThread1of3ForFork0_#t~mem6#1_1|) (<= (+ .cse1 v_~data~0.offset_5 4) (select |v_#length_8| v_~data~0.base_5)) (<= 0 .cse0)))) InVars {~data~0.offset=v_~data~0.offset_5, #memory_int=|v_#memory_int_12|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_15|, #length=|v_#length_8|, ~data~0.base=v_~data~0.base_5, #valid=|v_#valid_9|} OutVars{~data~0.base=v_~data~0.base_5, #valid=|v_#valid_9|, ~data~0.offset=v_~data~0.offset_5, #memory_int=|v_#memory_int_12|, thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_15|, #length=|v_#length_8|, thrThread1of3ForFork0_#t~mem6#1=|v_thrThread1of3ForFork0_#t~mem6#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~mem6#1]" "[508] L1049-->L1049-1: Formula: (= (ite (= |v_thrThread1of3ForFork0_#t~mem6#1_3| 1) 1 0) |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|) InVars {thrThread1of3ForFork0_#t~mem6#1=|v_thrThread1of3ForFork0_#t~mem6#1_3|} OutVars{thrThread1of3ForFork0_#t~mem6#1=|v_thrThread1of3ForFork0_#t~mem6#1_3|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1]" "[509] L1049-1-->L1023: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[510] L1023-->L1024: Formula: (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3| |v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|) InVars {thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_3|, thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_3|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[512] L1024-->L1024-2: Formula: (not (= |v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7| 0)) InVars {thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[]" "[514] L1024-2-->L1049-2: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_~cond#1_9|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_~cond#1]" "[517] L1049-2-->L1049-3: Formula: true InVars {} OutVars{thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1=|v_thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1_5|} AuxVars[] AssignedVars[thrThread1of3ForFork0___VERIFIER_assert_#in~cond#1]" "[520] L1049-3-->L1050: Formula: true InVars {} OutVars{thrThread1of3ForFork0_#t~mem6#1=|v_thrThread1of3ForFork0_#t~mem6#1_5|} AuxVars[] AssignedVars[thrThread1of3ForFork0_#t~mem6#1]" "[522] L1050-->L1046-1: Formula: (= (+ |v_thrThread1of3ForFork0_~c~0#1_17| 1) |v_thrThread1of3ForFork0_~c~0#1_18|) InVars {thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_17|} OutVars{thrThread1of3ForFork0_~c~0#1=|v_thrThread1of3ForFork0_~c~0#1_18|} AuxVars[] AssignedVars[thrThread1of3ForFork0_~c~0#1]" [2025-04-26 16:03:20,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:03:20,310 INFO L85 PathProgramCache]: Analyzing trace with hash -416060769, now seen corresponding path program 1 times [2025-04-26 16:03:20,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:03:20,310 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699308988] [2025-04-26 16:03:20,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:03:20,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:03:20,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 16:03:20,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 16:03:20,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:03:20,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:03:20,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:03:20,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-26 16:03:20,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-26 16:03:20,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:03:20,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:03:20,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:03:20,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:03:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2010091276, now seen corresponding path program 1 times [2025-04-26 16:03:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:03:20,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496592760] [2025-04-26 16:03:20,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:03:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:03:20,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:03:20,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:03:20,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:03:20,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:03:20,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:03:20,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:03:20,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:03:20,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:03:20,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:03:20,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:03:20,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:03:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1609433942, now seen corresponding path program 1 times [2025-04-26 16:03:20,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:03:20,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816893984] [2025-04-26 16:03:20,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:03:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:03:20,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-26 16:03:20,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-26 16:03:20,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:03:20,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:03:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:03:20,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:03:20,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816893984] [2025-04-26 16:03:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816893984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:03:20,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:03:20,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:03:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144480560] [2025-04-26 16:03:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:03:20,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:03:20,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:03:20,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:03:20,677 INFO L87 Difference]: Start difference. First operand currently 480689 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 15.0) internal successors, (in total 60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:03:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:03:24,069 INFO L93 Difference]: Finished difference Result 256042 states and 1033005 transitions. [2025-04-26 16:03:24,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 256042 states and 1033005 transitions. [2025-04-26 16:03:28,421 INFO L131 ngComponentsAnalysis]: Automaton has 18926 accepting balls. 198853 [2025-04-26 16:03:31,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 256042 states to 256041 states and 1033004 transitions. [2025-04-26 16:03:31,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 256041 [2025-04-26 16:03:32,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256041 [2025-04-26 16:03:32,489 INFO L74 IsDeterministic]: Start isDeterministic. Operand 256041 states and 1033004 transitions. [2025-04-26 16:03:33,145 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:03:33,145 INFO L218 hiAutomatonCegarLoop]: Abstraction has 256041 states and 1033004 transitions. [2025-04-26 16:03:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256041 states and 1033004 transitions. [2025-04-26 16:03:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256041 to 235284. [2025-04-26 16:03:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235284 states, 235284 states have (on average 4.063892997398888) internal successors, (in total 956169), 235283 states have internal predecessors, (956169), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0)