/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/weaver/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:09:10,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:09:10,346 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:09:10,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:09:10,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:09:10,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:09:10,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:09:10,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:09:10,366 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:09:10,366 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:09:10,367 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:09:10,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:09:10,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:09:10,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:09:10,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:09:10,369 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:09:10,369 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:09:10,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:09:10,369 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:09:10,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:09:10,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:09:10,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:09:10,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:09:10,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:09:10,370 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:09:10,370 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:09:10,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:09:10,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:09:10,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:09:10,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:09:10,596 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:09:10,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2025-04-26 16:09:11,901 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1a3de43dc/7d3f0bac624e4c30a516e7258a332506/FLAG4886845bb [2025-04-26 16:09:12,114 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:09:12,118 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2025-04-26 16:09:12,127 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1a3de43dc/7d3f0bac624e4c30a516e7258a332506/FLAG4886845bb [2025-04-26 16:09:12,902 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1a3de43dc/7d3f0bac624e4c30a516e7258a332506 [2025-04-26 16:09:12,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:09:12,905 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:09:12,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:09:12,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:09:12,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:09:12,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:09:12" (1/1) ... [2025-04-26 16:09:12,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8c395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:12, skipping insertion in model container [2025-04-26 16:09:12,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:09:12" (1/1) ... [2025-04-26 16:09:12,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:09:13,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:09:13,091 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:09:13,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:09:13,140 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:09:13,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13 WrapperNode [2025-04-26 16:09:13,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:09:13,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:09:13,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:09:13,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:09:13,146 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:09:13" (1/1) ... [2025-04-26 16:09:13,152 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:09:13" (1/1) ... [2025-04-26 16:09:13,175 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 145 [2025-04-26 16:09:13,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:09:13,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:09:13,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:09:13,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:09:13,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,187 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:09:13,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:09:13,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:09:13,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:09:13,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (1/1) ... [2025-04-26 16:09:13,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:13,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:13,216 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:09:13,219 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:09:13,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:09:13,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:09:13,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:09:13,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:09:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:09:13,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:09:13,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:09:13,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:09:13,235 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:09:13,299 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:09:13,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:09:13,483 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:09:13,483 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:09:13,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:09:13,491 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:09:13,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:13 BoogieIcfgContainer [2025-04-26 16:09:13,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:09:13,492 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:09:13,492 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:09:13,496 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:09:13,496 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:09:13,496 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:09:12" (1/3) ... [2025-04-26 16:09:13,497 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@550a7af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:09:13, skipping insertion in model container [2025-04-26 16:09:13,497 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:09:13,497 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:09:13" (2/3) ... [2025-04-26 16:09:13,497 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@550a7af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:09:13, skipping insertion in model container [2025-04-26 16:09:13,497 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:09:13,497 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:09:13" (3/3) ... [2025-04-26 16:09:13,498 INFO L376 chiAutomizerObserver]: Analyzing ICFG fibonacci.wvr.c [2025-04-26 16:09:13,577 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:09:13,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 210 transitions, 434 flow [2025-04-26 16:09:13,670 INFO L116 PetriNetUnfolderBase]: 12/206 cut-off events. [2025-04-26 16:09:13,671 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:09:13,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 206 events. 12/206 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 307 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 140. Up to 2 conditions per place. [2025-04-26 16:09:13,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 210 transitions, 434 flow [2025-04-26 16:09:13,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 206 transitions, 424 flow [2025-04-26 16:09:13,683 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 201 places, 206 transitions, 424 flow [2025-04-26 16:09:13,691 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:09:13,691 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:09:13,691 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:09:13,691 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:09:13,691 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:09:13,692 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:09:13,692 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:09:13,692 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:09:13,693 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:09:14,225 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 11394 [2025-04-26 16:09:14,226 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:09:14,226 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:09:14,230 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, 1, 1] [2025-04-26 16:09:14,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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, 1, 1] [2025-04-26 16:09:14,231 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:09:14,231 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 11654 states, but on-demand construction may add more states [2025-04-26 16:09:14,337 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 11394 [2025-04-26 16:09:14,337 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:09:14,337 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:09:14,339 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, 1, 1] [2025-04-26 16:09:14,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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, 1, 1] [2025-04-26 16:09:14,343 INFO L752 eck$LassoCheckResult]: Stem: "[385] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[392] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[326] L21-->L21-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[]" "[447] L21-1-->L21-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[]" "[402] L21-2-->L21-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[]" "[421] L21-3-->L21-4: Formula: (and (= 16 (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[]" "[300] L21-4-->L38: Formula: (= v_~n_0~0_5 0) InVars {} OutVars{~n_0~0=v_~n_0~0_5} AuxVars[] AssignedVars[~n_0~0]" "[412] L38-->L38-1: Formula: (= v_~f1_2~0_5 0) InVars {} OutVars{~f1_2~0=v_~f1_2~0_5} AuxVars[] AssignedVars[~f1_2~0]" "[422] L38-1-->L38-2: Formula: (= v_~f2_3~0_4 0) InVars {} OutVars{~f2_3~0=v_~f2_3~0_4} AuxVars[] AssignedVars[~f2_3~0]" "[340] L38-2-->L38-3: Formula: (= v_~l_4~0_2 0) InVars {} OutVars{~l_4~0=v_~l_4~0_2} AuxVars[] AssignedVars[~l_4~0]" "[281] L38-3-->L38-4: Formula: (= v_~f1_6~0_5 0) InVars {} OutVars{~f1_6~0=v_~f1_6~0_5} AuxVars[] AssignedVars[~f1_6~0]" "[418] L38-4-->L38-5: Formula: (= v_~f2_7~0_4 0) InVars {} OutVars{~f2_7~0=v_~f2_7~0_4} AuxVars[] AssignedVars[~f2_7~0]" "[262] L38-5-->L-1-1: Formula: (= v_~l_8~0_2 0) InVars {} OutVars{~l_8~0=v_~l_8~0_2} AuxVars[] AssignedVars[~l_8~0]" "[455] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[458] L-1-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[374] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[457] L64-1-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[450] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[325] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~n_0~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{~n_0~0=v_~n_0~0_6, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[~n_0~0]" "[370] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[454] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[324] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~f1_2~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~f1_2~0=v_~f1_2~0_6} AuxVars[] AssignedVars[~f1_2~0]" "[315] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[266] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[342] L69-1-->L69-2: Formula: (= v_~f2_3~0_5 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{~f2_3~0=v_~f2_3~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[~f2_3~0]" "[433] L69-2-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[302] L70-->L70-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[382] L70-1-->L70-2: Formula: (= v_~l_4~0_3 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~l_4~0=v_~l_4~0_3, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~l_4~0]" "[381] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[312] L71-->L71-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[376] L71-1-->L71-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_4| v_~f1_6~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~f1_6~0=v_~f1_6~0_6, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~f1_6~0]" "[341] L71-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[301] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1]" "[415] L72-1-->L72-2: Formula: (= v_~f2_7~0_5 |v_ULTIMATE.start_main_#t~nondet12#1_4|) InVars {ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_4|} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_4|, ~f2_7~0=v_~f2_7~0_5} AuxVars[] AssignedVars[~f2_7~0]" "[358] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1]" "[327] L73-->L73-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[441] L73-1-->L73-2: Formula: (= v_~l_8~0_3 |v_ULTIMATE.start_main_#t~nondet13#1_4|) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_4|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_4|, ~l_8~0=v_~l_8~0_3} AuxVars[] AssignedVars[~l_8~0]" "[277] L73-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[303] L76-->L76-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~f1_2~0_7 v_~f1_6~0_7) (= v_~f2_3~0_6 v_~f2_7~0_6)) 1 0)) InVars {~f2_7~0=v_~f2_7~0_6, ~f1_2~0=v_~f1_2~0_7, ~f2_3~0=v_~f2_3~0_6, ~f1_6~0=v_~f1_6~0_7} OutVars{~f2_7~0=v_~f2_7~0_6, ~f1_2~0=v_~f1_2~0_7, ~f2_3~0=v_~f2_3~0_6, ~f1_6~0=v_~f1_6~0_7, 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]" "[445] L76-1-->L34: 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]" "[383] L34-->L35: 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]" "[449] L35-->L34-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[]" "[442] L34-1-->L76-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]" "[451] L76-2-->L78: 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]" "[268] L78-->L78-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[323] L78-1-->L78-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[397] L78-2-->L78-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_4| |v_ULTIMATE.start_main_#t~pre14#1_4|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[599] L78-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_8|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_14|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[467] $Ultimate##0-->L44: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1| |v_thread1Thread1of1ForFork0_~_argptr#1.base_1|) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1| |v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|)) InVars {thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} OutVars{thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_1|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_1|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_1|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_~_argptr#1.base]" "[468] L44-->L44-5: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" [2025-04-26 16:09:14,344 INFO L754 eck$LassoCheckResult]: Loop: "[470] L44-5-->L45: Formula: (< |v_thread1Thread1of1ForFork0_~i~0#1_5| v_~n_0~0_1) InVars {~n_0~0=v_~n_0~0_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} OutVars{~n_0~0=v_~n_0~0_1, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_5|} AuxVars[] AssignedVars[]" "[472] L45-->L45-1: Formula: (and (= v_~f2_3~0_1 |v_thread1Thread1of1ForFork0_plus_#in~b#1_1|) (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_1| v_~f1_2~0_1)) InVars {~f2_3~0=v_~f2_3~0_1, ~f1_2~0=v_~f1_2~0_1} OutVars{thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_1|, ~f1_2~0=v_~f1_2~0_1, ~f2_3~0=v_~f2_3~0_1, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[474] L45-1-->L45-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[476] L45-2-->L95: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[478] L95-->L95-1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~a#1_3| |v_thread1Thread1of1ForFork0_plus_~a#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_3|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1]" "[479] L95-1-->L96: Formula: (= |v_thread1Thread1of1ForFork0_plus_#in~b#1_3| |v_thread1Thread1of1ForFork0_plus_~b#1_3|) InVars {thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~b#1]" "[480] L96-->L96-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (or (<= 0 |v_thread1Thread1of1ForFork0_plus_~b#1_5|) (<= 0 (+ |v_thread1Thread1of1ForFork0_plus_~a#1_5| |v_thread1Thread1of1ForFork0_plus_~b#1_5| 2147483648))) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[481] L96-1-->L34: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[482] L34-->L35: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[484] L35-->L34-1: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[486] L34-1-->L96-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[487] L96-2-->L97: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[488] L97-->L97-1: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (or (<= (+ |v_thread1Thread1of1ForFork0_plus_~a#1_7| |v_thread1Thread1of1ForFork0_plus_~b#1_7|) 2147483647) (<= |v_thread1Thread1of1ForFork0_plus_~b#1_7| 0)) 1 0)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[489] L97-1-->L34-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[490] L34-2-->L35-3: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_13|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[492] L35-3-->L34-3: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[494] L34-3-->L97-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[495] L97-2-->L98: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[496] L98-->plus_returnLabel#1: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_3| (+ |v_thread1Thread1of1ForFork0_plus_~a#1_9| |v_thread1Thread1of1ForFork0_plus_~b#1_9|)) InVars {thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_9|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_3|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#res#1]" "[497] plus_returnLabel#1-->L45-3: Formula: (= |v_thread1Thread1of1ForFork0_plus_#res#1_5| |v_thread1Thread1of1ForFork0_#t~ret1#1_1|) InVars {thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_1|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1]" "[498] L45-3-->L45-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_11|, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_plus_~b#1]" "[499] L45-4-->L45-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_5|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_plus_#in~b#1]" "[500] L45-5-->L45-6: Formula: (= |v_thread1Thread1of1ForFork0_#t~ret1#1_3| v_~f1_2~0_2) InVars {thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_3|} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_3|, ~f1_2~0=v_~f1_2~0_2} AuxVars[] AssignedVars[~f1_2~0]" "[501] L45-6-->L46: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1]" "[502] L46-->L46-1: Formula: (and (= v_~f2_3~0_2 |v_thread1Thread1of1ForFork0_minus_#in~b#1_1|) (= |v_thread1Thread1of1ForFork0_minus_#in~a#1_1| v_~f1_2~0_3)) InVars {~f2_3~0=v_~f2_3~0_2, ~f1_2~0=v_~f1_2~0_3} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_1|, ~f1_2~0=v_~f1_2~0_3, ~f2_3~0=v_~f2_3~0_2, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1]" "[503] L46-1-->L46-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1]" "[504] L46-2-->L89: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_1|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1]" "[505] L89-->L89-1: Formula: (= |v_thread1Thread1of1ForFork0_minus_~a#1_3| |v_thread1Thread1of1ForFork0_minus_#in~a#1_3|) InVars {thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_3|} OutVars{thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_3|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_~a#1]" "[506] L89-1-->L90: Formula: (= |v_thread1Thread1of1ForFork0_minus_~b#1_3| |v_thread1Thread1of1ForFork0_minus_#in~b#1_3|) InVars {thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_3|} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_3|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_~b#1]" "[507] L90-->L90-1: Formula: (= (ite (or (<= |v_thread1Thread1of1ForFork0_minus_~b#1_5| 0) (<= |v_thread1Thread1of1ForFork0_minus_~b#1_5| (+ |v_thread1Thread1of1ForFork0_minus_~a#1_5| 2147483648))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|) InVars {thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_5|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_5|} OutVars{thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_13|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[508] L90-1-->L34-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[509] L34-4-->L35-6: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_23| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_15|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_15|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_23|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[511] L35-6-->L34-5: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_27|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_27|} AuxVars[] AssignedVars[]" "[513] L34-5-->L90-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_29|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[514] L90-2-->L91: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[515] L91-->L91-1: Formula: (= (ite (or (<= 0 |v_thread1Thread1of1ForFork0_minus_~b#1_7|) (<= |v_thread1Thread1of1ForFork0_minus_~a#1_7| (+ 2147483647 |v_thread1Thread1of1ForFork0_minus_~b#1_7|))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) InVars {thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_7|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_7|} OutVars{thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_7|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[516] L91-1-->L34-6: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[517] L34-6-->L35-9: Formula: (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[519] L35-9-->L34-7: Formula: (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) InVars {thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|} AuxVars[] AssignedVars[]" "[521] L34-7-->L91-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1]" "[522] L91-2-->L92: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1]" "[523] L92-->minus_returnLabel#1: Formula: (= |v_thread1Thread1of1ForFork0_minus_~a#1_9| (+ |v_thread1Thread1of1ForFork0_minus_#res#1_3| |v_thread1Thread1of1ForFork0_minus_~b#1_9|)) InVars {thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_9|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_9|} OutVars{thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_9|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_3|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#res#1]" "[524] minus_returnLabel#1-->L46-3: Formula: (= |v_thread1Thread1of1ForFork0_minus_#res#1_5| |v_thread1Thread1of1ForFork0_#t~ret2#1_1|) InVars {thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_5|} OutVars{thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_5|, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[525] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_11|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_minus_~a#1]" "[526] L46-4-->L46-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_5|, thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_minus_#in~a#1]" "[527] L46-5-->L46-6: Formula: (= v_~f2_3~0_3 |v_thread1Thread1of1ForFork0_#t~ret2#1_3|) InVars {thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} OutVars{~f2_3~0=v_~f2_3~0_3, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_3|} AuxVars[] AssignedVars[~f2_3~0]" "[528] L46-6-->L44-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret2#1]" "[529] L44-2-->L44-3: Formula: (= |v_thread1Thread1of1ForFork0_#t~post3#1_1| |v_thread1Thread1of1ForFork0_~i~0#1_9|) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_1|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" "[530] L44-3-->L44-4: Formula: (= |v_thread1Thread1of1ForFork0_~i~0#1_11| (+ |v_thread1Thread1of1ForFork0_#t~post3#1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_3|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0#1]" "[531] L44-4-->L44-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3#1]" [2025-04-26 16:09:14,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:09:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash -502489752, now seen corresponding path program 1 times [2025-04-26 16:09:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:09:14,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358632213] [2025-04-26 16:09:14,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:09:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:09:14,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:09:14,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:09:14,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:14,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:14,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:09:14,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:09:14,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:09:14,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:14,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:14,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:09:14,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:09:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2034374944, now seen corresponding path program 1 times [2025-04-26 16:09:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:09:14,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927625364] [2025-04-26 16:09:14,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:09:14,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:09:14,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:09:14,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:09:14,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:14,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:14,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:09:14,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:09:14,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:09:14,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:14,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:14,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:09:14,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:09:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash -872268665, now seen corresponding path program 1 times [2025-04-26 16:09:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:09:14,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201783382] [2025-04-26 16:09:14,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:09:14,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:09:14,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-26 16:09:14,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-26 16:09:14,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:14,571 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:09:14,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-26 16:09:14,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-26 16:09:14,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:14,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:14,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:09:14,890 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:09:14,891 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:09:14,891 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:09:14,891 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:09:14,891 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:09:14,891 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:14,891 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:09:14,891 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:09:14,892 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_petrified1_Iteration1_Loop [2025-04-26 16:09:14,892 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:09:14,892 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:09:14,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:14,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,276 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:09:15,277 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:09:15,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:15,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:15,281 INFO L229 MonitoredProcess]: Starting monitored process 2 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:09:15,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:09:15,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:15,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:15,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:15,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:15,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:15,304 INFO L229 MonitoredProcess]: Starting monitored process 3 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:09:15,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:09:15,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:09:15,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:15,378 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:09:15,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:15,383 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:09:15,383 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:09:15,383 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:09:15,383 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:09:15,383 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:09:15,383 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:15,383 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:09:15,383 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:09:15,383 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_petrified1_Iteration1_Loop [2025-04-26 16:09:15,383 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:09:15,383 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:09:15,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:15,702 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:09:15,708 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:09:15,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:15,710 INFO L229 MonitoredProcess]: Starting monitored process 4 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:09:15,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:09:15,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:15,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:15,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:09:15,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:15,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:09:15,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:15,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:09:15,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:09:15,731 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:09:15,738 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:09:15,738 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:09:15,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:15,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:15,742 INFO L229 MonitoredProcess]: Starting monitored process 5 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:09:15,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:09:15,743 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:09:15,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:09:15,747 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:09:15,747 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:09:15,748 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread1Thread1of1ForFork0_~i~0#1) = 1*~n_0~0 - 1*thread1Thread1of1ForFork0_~i~0#1 Supporting invariants [] [2025-04-26 16:09:15,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:15,756 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:09:15,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:09:15,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:09:15,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:09:15,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:15,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:09:15,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:09:15,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:09:15,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:09:15,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:09:15,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:15,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:09:15,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:09:15,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:09:16,121 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:09:16,145 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:09:16,147 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 11654 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 20.0) internal successors, (in total 100), 5 states have internal predecessors, (100), 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:09:16,703 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 11654 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (in total 100), 5 states have internal predecessors, (100), 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) Result 34815 states and 96273 transitions. Complement of second has 10 states. [2025-04-26 16:09:16,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:09:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.0) internal successors, (in total 100), 5 states have internal predecessors, (100), 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:09:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2025-04-26 16:09:16,711 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 641 transitions. Stem has 50 letters. Loop has 50 letters. [2025-04-26 16:09:16,713 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:09:16,713 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 641 transitions. Stem has 100 letters. Loop has 50 letters. [2025-04-26 16:09:16,713 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:09:16,714 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 641 transitions. Stem has 50 letters. Loop has 100 letters. [2025-04-26 16:09:16,715 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:09:16,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34815 states and 96273 transitions. [2025-04-26 16:09:17,023 INFO L131 ngComponentsAnalysis]: Automaton has 184 accepting balls. 9252 [2025-04-26 16:09:17,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34815 states to 19821 states and 53395 transitions. [2025-04-26 16:09:17,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10265 [2025-04-26 16:09:17,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10948 [2025-04-26 16:09:17,197 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19821 states and 53395 transitions. [2025-04-26 16:09:17,197 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:09:17,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19821 states and 53395 transitions. [2025-04-26 16:09:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19821 states and 53395 transitions. [2025-04-26 16:09:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19821 to 19140. [2025-04-26 16:09:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19140 states, 19140 states have (on average 2.6871473354231976) internal successors, (in total 51432), 19139 states have internal predecessors, (51432), 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:09:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19140 states to 19140 states and 51432 transitions. [2025-04-26 16:09:17,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19140 states and 51432 transitions. [2025-04-26 16:09:17,789 INFO L438 stractBuchiCegarLoop]: Abstraction has 19140 states and 51432 transitions. [2025-04-26 16:09:17,789 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:09:17,789 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19140 states and 51432 transitions. [2025-04-26 16:09:17,869 INFO L131 ngComponentsAnalysis]: Automaton has 184 accepting balls. 9252 [2025-04-26 16:09:17,869 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:09:17,869 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:09:17,871 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:09:17,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop 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, 1, 1] [2025-04-26 16:09:17,872 INFO L752 eck$LassoCheckResult]: Stem: "[385] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[392] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[326] L21-->L21-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[]" "[447] L21-1-->L21-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[]" "[402] L21-2-->L21-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[]" "[421] L21-3-->L21-4: Formula: (and (= 16 (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[]" "[300] L21-4-->L38: Formula: (= v_~n_0~0_5 0) InVars {} OutVars{~n_0~0=v_~n_0~0_5} AuxVars[] AssignedVars[~n_0~0]" "[412] L38-->L38-1: Formula: (= v_~f1_2~0_5 0) InVars {} OutVars{~f1_2~0=v_~f1_2~0_5} AuxVars[] AssignedVars[~f1_2~0]" "[422] L38-1-->L38-2: Formula: (= v_~f2_3~0_4 0) InVars {} OutVars{~f2_3~0=v_~f2_3~0_4} AuxVars[] AssignedVars[~f2_3~0]" "[340] L38-2-->L38-3: Formula: (= v_~l_4~0_2 0) InVars {} OutVars{~l_4~0=v_~l_4~0_2} AuxVars[] AssignedVars[~l_4~0]" "[281] L38-3-->L38-4: Formula: (= v_~f1_6~0_5 0) InVars {} OutVars{~f1_6~0=v_~f1_6~0_5} AuxVars[] AssignedVars[~f1_6~0]" "[418] L38-4-->L38-5: Formula: (= v_~f2_7~0_4 0) InVars {} OutVars{~f2_7~0=v_~f2_7~0_4} AuxVars[] AssignedVars[~f2_7~0]" "[262] L38-5-->L-1-1: Formula: (= v_~l_8~0_2 0) InVars {} OutVars{~l_8~0=v_~l_8~0_2} AuxVars[] AssignedVars[~l_8~0]" "[455] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[458] L-1-2-->L64: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_2|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_2|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_2|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_2|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre14#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~nondet15#1, ULTIMATE.start_main_~t2~0#1]" "[374] L64-->L64-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[457] L64-1-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[450] L67-->L67-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[325] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_4| v_~n_0~0_6) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} OutVars{~n_0~0=v_~n_0~0_6, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[~n_0~0]" "[370] L67-2-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1]" "[454] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[324] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_4| v_~f1_2~0_6) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|, ~f1_2~0=v_~f1_2~0_6} AuxVars[] AssignedVars[~f1_2~0]" "[315] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1]" "[266] L69-->L69-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[342] L69-1-->L69-2: Formula: (= v_~f2_3~0_5 |v_ULTIMATE.start_main_#t~nondet9#1_4|) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} OutVars{~f2_3~0=v_~f2_3~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[~f2_3~0]" "[433] L69-2-->L70: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1]" "[302] L70-->L70-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[382] L70-1-->L70-2: Formula: (= v_~l_4~0_3 |v_ULTIMATE.start_main_#t~nondet10#1_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} OutVars{~l_4~0=v_~l_4~0_3, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[~l_4~0]" "[381] L70-2-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[312] L71-->L71-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[376] L71-1-->L71-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_4| v_~f1_6~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} OutVars{~f1_6~0=v_~f1_6~0_6, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[~f1_6~0]" "[341] L71-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[301] L72-->L72-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1]" "[415] L72-1-->L72-2: Formula: (= v_~f2_7~0_5 |v_ULTIMATE.start_main_#t~nondet12#1_4|) InVars {ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_4|} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_4|, ~f2_7~0=v_~f2_7~0_5} AuxVars[] AssignedVars[~f2_7~0]" "[358] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1]" "[327] L73-->L73-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[441] L73-1-->L73-2: Formula: (= v_~l_8~0_3 |v_ULTIMATE.start_main_#t~nondet13#1_4|) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_4|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_4|, ~l_8~0=v_~l_8~0_3} AuxVars[] AssignedVars[~l_8~0]" "[277] L73-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1]" "[303] L76-->L76-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~f1_2~0_7 v_~f1_6~0_7) (= v_~f2_3~0_6 v_~f2_7~0_6)) 1 0)) InVars {~f2_7~0=v_~f2_7~0_6, ~f1_2~0=v_~f1_2~0_7, ~f2_3~0=v_~f2_3~0_6, ~f1_6~0=v_~f1_6~0_7} OutVars{~f2_7~0=v_~f2_7~0_6, ~f1_2~0=v_~f1_2~0_7, ~f2_3~0=v_~f2_3~0_6, ~f1_6~0=v_~f1_6~0_7, 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]" "[445] L76-1-->L34: 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]" "[383] L34-->L35: 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]" "[449] L35-->L34-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[]" "[442] L34-1-->L76-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]" "[451] L76-2-->L78: 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]" "[268] L78-->L78-1: Formula: (= |v_ULTIMATE.start_main_#t~pre14#1_3| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_3|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[323] L78-1-->L78-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[397] L78-2-->L78-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_4| |v_ULTIMATE.start_main_#t~pre14#1_4|) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_4|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[599] L78-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4| 0) (= v_thread1Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= v_thread1Thread1of1ForFork0_thidvar1_2 0) (= |v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread1Thread1of1ForFork0_minus_#in~a#1=|v_thread1Thread1of1ForFork0_minus_#in~a#1_8|, thread1Thread1of1ForFork0_plus_#in~a#1=|v_thread1Thread1of1ForFork0_plus_#in~a#1_8|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, thread1Thread1of1ForFork0_#t~ret2#1=|v_thread1Thread1of1ForFork0_#t~ret2#1_8|, thread1Thread1of1ForFork0_~_argptr#1.offset=|v_thread1Thread1of1ForFork0_~_argptr#1.offset_4|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_42|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_4|, thread1Thread1of1ForFork0_#in~_argptr#1.offset=|v_thread1Thread1of1ForFork0_#in~_argptr#1.offset_4|, thread1Thread1of1ForFork0_#t~ret1#1=|v_thread1Thread1of1ForFork0_#t~ret1#1_8|, thread1Thread1of1ForFork0_minus_#res#1=|v_thread1Thread1of1ForFork0_minus_#res#1_8|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_4|, thread1Thread1of1ForFork0_plus_~a#1=|v_thread1Thread1of1ForFork0_plus_~a#1_14|, thread1Thread1of1ForFork0_#in~_argptr#1.base=|v_thread1Thread1of1ForFork0_#in~_argptr#1.base_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_plus_~b#1=|v_thread1Thread1of1ForFork0_plus_~b#1_14|, thread1Thread1of1ForFork0_~_argptr#1.base=|v_thread1Thread1of1ForFork0_~_argptr#1.base_4|, thread1Thread1of1ForFork0_minus_#in~b#1=|v_thread1Thread1of1ForFork0_minus_#in~b#1_8|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread1Thread1of1ForFork0_minus_~b#1=|v_thread1Thread1of1ForFork0_minus_~b#1_14|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_8|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_14|, thread1Thread1of1ForFork0_minus_~a#1=|v_thread1Thread1of1ForFork0_minus_~a#1_14|, thread1Thread1of1ForFork0_plus_#in~b#1=|v_thread1Thread1of1ForFork0_plus_#in~b#1_8|, thread1Thread1of1ForFork0_plus_#res#1=|v_thread1Thread1of1ForFork0_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret1#1, thread1Thread1of1ForFork0_minus_#res#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_plus_~a#1, thread1Thread1of1ForFork0_minus_#in~a#1, thread1Thread1of1ForFork0_#in~_argptr#1.base, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_plus_#in~a#1, thread1Thread1of1ForFork0_thidvar1, thread1Thread1of1ForFork0_plus_~b#1, thread1Thread1of1ForFork0_~_argptr#1.base, thread1Thread1of1ForFork0_minus_#in~b#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_minus_~b#1, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_#t~ret2#1, thread1Thread1of1ForFork0_~_argptr#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_minus_~a#1, thread1Thread1of1ForFork0_plus_#in~b#1, thread1Thread1of1ForFork0_plus_#res#1, thread1Thread1of1ForFork0_#res#1.base, thread1Thread1of1ForFork0_#in~_argptr#1.offset]" "[283] L78-4-->L78-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre14#1]" "[426] L78-5-->L79: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet15#1]" "[292] L79-->L79-1: Formula: (= |v_ULTIMATE.start_main_#t~pre16#1_3| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre16#1]" "[443] L79-1-->L79-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[390] L79-2-->L79-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_4| |v_ULTIMATE.start_main_#t~pre16#1_4|) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_4|} OutVars{ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_4|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[602] L79-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= v_thread2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_7|) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4| 0) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2) (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|} OutVars{thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_4|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_14|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_8|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_14|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_8|, thread2Thread1of1ForFork1_#t~ret4#1=|v_thread2Thread1of1ForFork1_#t~ret4#1_8|, thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_14|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_8|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_8|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_14|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_8|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_7|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_8|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_8|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_14|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_8|, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_42|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_4|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_4|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_4|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_plus_~a#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_minus_#res#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~ret5#1, thread2Thread1of1ForFork1_#t~ret4#1, thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_plus_#res#1, thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_minus_#in~b#1, thread2Thread1of1ForFork1_~_argptr#1.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_#t~post6#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_minus_~b#1, thread2Thread1of1ForFork1_plus_#in~b#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.base, thread2Thread1of1ForFork1_#in~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_thidvar1]" "[532] $Ultimate##0-->L54: Formula: (and (= |v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1| |v_thread2Thread1of1ForFork1_~_argptr#1.base_1|) (= |v_thread2Thread1of1ForFork1_~_argptr#1.offset_1| |v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|)) InVars {thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|} OutVars{thread2Thread1of1ForFork1_#in~_argptr#1.base=|v_thread2Thread1of1ForFork1_#in~_argptr#1.base_1|, thread2Thread1of1ForFork1_~_argptr#1.offset=|v_thread2Thread1of1ForFork1_~_argptr#1.offset_1|, thread2Thread1of1ForFork1_#in~_argptr#1.offset=|v_thread2Thread1of1ForFork1_#in~_argptr#1.offset_1|, thread2Thread1of1ForFork1_~_argptr#1.base=|v_thread2Thread1of1ForFork1_~_argptr#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~_argptr#1.offset, thread2Thread1of1ForFork1_~_argptr#1.base]" "[533] L54-->L54-5: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" [2025-04-26 16:09:17,873 INFO L754 eck$LassoCheckResult]: Loop: "[535] L54-5-->L55: Formula: (< |v_thread2Thread1of1ForFork1_~i~1#1_5| v_~n_0~0_4) InVars {~n_0~0=v_~n_0~0_4, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|} OutVars{~n_0~0=v_~n_0~0_4, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_5|} AuxVars[] AssignedVars[]" "[537] L55-->L55-1: Formula: (and (= v_~f2_7~0_3 |v_thread2Thread1of1ForFork1_plus_#in~b#1_1|) (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_1| v_~f1_6~0_3)) InVars {~f1_6~0=v_~f1_6~0_3, ~f2_7~0=v_~f2_7~0_3} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_1|, ~f2_7~0=v_~f2_7~0_3, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_1|, ~f1_6~0=v_~f1_6~0_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_plus_#in~b#1]" "[539] L55-1-->L55-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#res#1]" "[541] L55-2-->L95: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_1|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1]" "[543] L95-->L95-1: Formula: (= |v_thread2Thread1of1ForFork1_plus_#in~a#1_3| |v_thread2Thread1of1ForFork1_plus_~a#1_3|) InVars {thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_3|} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_3|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_~a#1]" "[544] L95-1-->L96: Formula: (= |v_thread2Thread1of1ForFork1_plus_#in~b#1_3| |v_thread2Thread1of1ForFork1_plus_~b#1_3|) InVars {thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_3|} OutVars{thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_3|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_~b#1]" "[545] L96-->L96-1: Formula: (= (ite (or (<= 0 (+ |v_thread2Thread1of1ForFork1_plus_~a#1_5| |v_thread2Thread1of1ForFork1_plus_~b#1_5| 2147483648)) (<= 0 |v_thread2Thread1of1ForFork1_plus_~b#1_5|)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_5|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_5|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_5|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[546] L96-1-->L34: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[547] L34-->L35: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[549] L35-->L34-1: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[]" "[551] L34-1-->L96-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[552] L96-2-->L97: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[553] L97-->L97-1: Formula: (= (ite (or (<= |v_thread2Thread1of1ForFork1_plus_~b#1_7| 0) (<= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_7| |v_thread2Thread1of1ForFork1_plus_~b#1_7|) 2147483647)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) InVars {thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_7|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_7|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_7|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[554] L97-1-->L34-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[555] L34-2-->L35-3: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[557] L35-3-->L34-3: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[]" "[559] L34-3-->L97-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[560] L97-2-->L98: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[561] L98-->plus_returnLabel#1: Formula: (= (+ |v_thread2Thread1of1ForFork1_plus_~a#1_9| |v_thread2Thread1of1ForFork1_plus_~b#1_9|) |v_thread2Thread1of1ForFork1_plus_#res#1_3|) InVars {thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_9|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_9|} OutVars{thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_3|, thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_9|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#res#1]" "[562] plus_returnLabel#1-->L55-3: Formula: (= |v_thread2Thread1of1ForFork1_#t~ret4#1_1| |v_thread2Thread1of1ForFork1_plus_#res#1_5|) InVars {thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_5|} OutVars{thread2Thread1of1ForFork1_#t~ret4#1=|v_thread2Thread1of1ForFork1_#t~ret4#1_1|, thread2Thread1of1ForFork1_plus_#res#1=|v_thread2Thread1of1ForFork1_plus_#res#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret4#1]" "[563] L55-3-->L55-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_plus_~b#1=|v_thread2Thread1of1ForFork1_plus_~b#1_11|, thread2Thread1of1ForFork1_plus_~a#1=|v_thread2Thread1of1ForFork1_plus_~a#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_~b#1, thread2Thread1of1ForFork1_plus_~a#1]" "[564] L55-4-->L55-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_plus_#in~a#1=|v_thread2Thread1of1ForFork1_plus_#in~a#1_5|, thread2Thread1of1ForFork1_plus_#in~b#1=|v_thread2Thread1of1ForFork1_plus_#in~b#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_plus_#in~a#1, thread2Thread1of1ForFork1_plus_#in~b#1]" "[565] L55-5-->L55-6: Formula: (= |v_thread2Thread1of1ForFork1_#t~ret4#1_3| v_~f1_6~0_4) InVars {thread2Thread1of1ForFork1_#t~ret4#1=|v_thread2Thread1of1ForFork1_#t~ret4#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ret4#1=|v_thread2Thread1of1ForFork1_#t~ret4#1_3|, ~f1_6~0=v_~f1_6~0_4} AuxVars[] AssignedVars[~f1_6~0]" "[566] L55-6-->L56: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ret4#1=|v_thread2Thread1of1ForFork1_#t~ret4#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret4#1]" "[567] L56-->L56-1: Formula: (and (= v_~f1_6~0_1 |v_thread2Thread1of1ForFork1_minus_#in~a#1_1|) (= v_~f2_7~0_1 |v_thread2Thread1of1ForFork1_minus_#in~b#1_1|)) InVars {~f1_6~0=v_~f1_6~0_1, ~f2_7~0=v_~f2_7~0_1} OutVars{thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_1|, ~f2_7~0=v_~f2_7~0_1, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_1|, ~f1_6~0=v_~f1_6~0_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[568] L56-1-->L56-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[569] L56-2-->L89: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_1|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[570] L89-->L89-1: Formula: (= |v_thread2Thread1of1ForFork1_minus_~a#1_3| |v_thread2Thread1of1ForFork1_minus_#in~a#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_3|, thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1]" "[571] L89-1-->L90: Formula: (= |v_thread2Thread1of1ForFork1_minus_~b#1_3| |v_thread2Thread1of1ForFork1_minus_#in~b#1_3|) InVars {thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} OutVars{thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_3|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~b#1]" "[572] L90-->L90-1: Formula: (= (ite (or (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| 0) (<= |v_thread2Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread2Thread1of1ForFork1_minus_~a#1_5| 2147483648))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_5|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[573] L90-1-->L34-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[574] L34-4-->L35-6: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[576] L35-6-->L34-5: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|} AuxVars[] AssignedVars[]" "[578] L34-5-->L90-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[579] L90-2-->L91: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[580] L91-->L91-1: Formula: (= (ite (or (<= 0 |v_thread2Thread1of1ForFork1_minus_~b#1_7|) (<= |v_thread2Thread1of1ForFork1_minus_~a#1_7| (+ 2147483647 |v_thread2Thread1of1ForFork1_minus_~b#1_7|))) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_7|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_7|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[581] L91-1-->L34-6: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_31|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[582] L34-6-->L35-9: Formula: (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[584] L35-9-->L34-7: Formula: (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| 0)) InVars {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|} AuxVars[] AssignedVars[]" "[586] L34-7-->L91-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1]" "[587] L91-2-->L92: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1]" "[588] L92-->minus_returnLabel#1: Formula: (= (+ |v_thread2Thread1of1ForFork1_minus_#res#1_3| |v_thread2Thread1of1ForFork1_minus_~b#1_9|) |v_thread2Thread1of1ForFork1_minus_~a#1_9|) InVars {thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_9|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_9|, thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#res#1]" "[589] minus_returnLabel#1-->L56-3: Formula: (= |v_thread2Thread1of1ForFork1_minus_#res#1_5| |v_thread2Thread1of1ForFork1_#t~ret5#1_1|) InVars {thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|} OutVars{thread2Thread1of1ForFork1_minus_#res#1=|v_thread2Thread1of1ForFork1_minus_#res#1_5|, thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[590] L56-3-->L56-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_~a#1=|v_thread2Thread1of1ForFork1_minus_~a#1_11|, thread2Thread1of1ForFork1_minus_~b#1=|v_thread2Thread1of1ForFork1_minus_~b#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_~a#1, thread2Thread1of1ForFork1_minus_~b#1]" "[591] L56-4-->L56-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_minus_#in~a#1=|v_thread2Thread1of1ForFork1_minus_#in~a#1_5|, thread2Thread1of1ForFork1_minus_#in~b#1=|v_thread2Thread1of1ForFork1_minus_#in~b#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_minus_#in~a#1, thread2Thread1of1ForFork1_minus_#in~b#1]" "[592] L56-5-->L56-6: Formula: (= v_~f2_7~0_2 |v_thread2Thread1of1ForFork1_#t~ret5#1_3|) InVars {thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|} OutVars{thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_3|, ~f2_7~0=v_~f2_7~0_2} AuxVars[] AssignedVars[~f2_7~0]" "[593] L56-6-->L54-2: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~ret5#1=|v_thread2Thread1of1ForFork1_#t~ret5#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~ret5#1]" "[594] L54-2-->L54-3: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_9| |v_thread2Thread1of1ForFork1_#t~post6#1_1|) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" "[595] L54-3-->L54-4: Formula: (= (+ |v_thread2Thread1of1ForFork1_#t~post6#1_3| 1) |v_thread2Thread1of1ForFork1_~i~1#1_11|) InVars {thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_3|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_11|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1]" "[596] L54-4-->L54-5: Formula: true InVars {} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post6#1]" [2025-04-26 16:09:17,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:09:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1934551262, now seen corresponding path program 1 times [2025-04-26 16:09:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:09:17,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55965721] [2025-04-26 16:09:17,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:09:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:09:17,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-26 16:09:17,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-26 16:09:17,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:17,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:17,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:09:17,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-26 16:09:17,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-26 16:09:17,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:17,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:17,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:09:17,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:09:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1852527104, now seen corresponding path program 1 times [2025-04-26 16:09:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:09:17,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854276398] [2025-04-26 16:09:17,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:09:17,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:09:17,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:09:17,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:09:17,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:17,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:17,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:09:17,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:09:17,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:09:17,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:17,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:17,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:09:17,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:09:17,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1049133343, now seen corresponding path program 1 times [2025-04-26 16:09:17,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:09:17,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079825526] [2025-04-26 16:09:17,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:09:17,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:09:17,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-04-26 16:09:17,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-26 16:09:17,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:17,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:17,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:09:17,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-04-26 16:09:17,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-04-26 16:09:17,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:17,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:09:18,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:09:18,152 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:09:18,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:09:18,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:09:18,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:09:18,152 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:09:18,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:09:18,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:09:18,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_petrified1_Iteration2_Loop [2025-04-26 16:09:18,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:09:18,152 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:09:18,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,405 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:09:18,405 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:09:18,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,407 INFO L229 MonitoredProcess]: Starting monitored process 6 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:09:18,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:09:18,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:18,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,420 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:09:18,421 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_minus_~b#1=0} Honda state: {thread2Thread1of1ForFork1_minus_~b#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:09:18,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:18,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,428 INFO L229 MonitoredProcess]: Starting monitored process 7 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:09:18,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:09:18,431 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:18,431 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,442 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:09:18,442 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_minus_#in~a#1=0} Honda state: {thread2Thread1of1ForFork1_minus_#in~a#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:09:18,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:18,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,451 INFO L229 MonitoredProcess]: Starting monitored process 8 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:09:18,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:09:18,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:18,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,464 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:09:18,464 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=0} Honda state: {thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:09:18,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:18,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,472 INFO L229 MonitoredProcess]: Starting monitored process 9 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:09:18,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:09:18,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:18,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,503 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:09:18,503 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_minus_#res#1=0, ~f2_7~0=0, thread2Thread1of1ForFork1_plus_#res#1=0, ~f1_6~0=0} Honda state: {thread2Thread1of1ForFork1_minus_#res#1=0, ~f2_7~0=0, thread2Thread1of1ForFork1_plus_#res#1=0, ~f1_6~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:09:18,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:18,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,511 INFO L229 MonitoredProcess]: Starting monitored process 10 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:09:18,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:09:18,514 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:18,514 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,530 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:09:18,530 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=0} Honda state: {thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:09:18,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:18,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,580 INFO L229 MonitoredProcess]: Starting monitored process 11 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:09:18,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:09:18,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:18,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,599 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:09:18,600 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_3=0} Honda state: {v_rep#funAddr~thread1.offset_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:09:18,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:18,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,608 INFO L229 MonitoredProcess]: Starting monitored process 12 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:09:18,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:09:18,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:18,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,620 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:09:18,620 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_#t~post6#1=0} Honda state: {thread2Thread1of1ForFork1_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:09:18,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:09:18,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,627 INFO L229 MonitoredProcess]: Starting monitored process 13 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:09:18,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:09:18,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:18,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,640 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:09:18,640 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_minus_~a#1=0} Honda state: {thread2Thread1of1ForFork1_minus_~a#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:09:18,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:18,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,647 INFO L229 MonitoredProcess]: Starting monitored process 14 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:09:18,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:09:18,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:09:18,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:09:18,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,667 INFO L229 MonitoredProcess]: Starting monitored process 15 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:09:18,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:09:18,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:09:18,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:09:18,727 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:09:18,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:18,731 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:09:18,732 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:09:18,732 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:09:18,732 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:09:18,732 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:09:18,732 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,732 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:09:18,732 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:09:18,732 INFO L132 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_petrified1_Iteration2_Loop [2025-04-26 16:09:18,732 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:09:18,732 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:09:18,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:09:18,995 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:09:18,995 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:09:18,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:18,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:18,997 INFO L229 MonitoredProcess]: Starting monitored process 16 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:09:18,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:09:19,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:19,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:19,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:09:19,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:19,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:09:19,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:19,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:09:19,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:09:19,012 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:09:19,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:09:19,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:19,019 INFO L229 MonitoredProcess]: Starting monitored process 17 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:09:19,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:09:19,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:19,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:19,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:09:19,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:19,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:09:19,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:19,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:09:19,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:09:19,031 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:09:19,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:09:19,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:19,038 INFO L229 MonitoredProcess]: Starting monitored process 18 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:09:19,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:09:19,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:19,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:19,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:09:19,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:19,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:09:19,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:19,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:09:19,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:09:19,051 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:09:19,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:09:19,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:19,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:19,058 INFO L229 MonitoredProcess]: Starting monitored process 19 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:09:19,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:09:19,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:19,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:19,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:09:19,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:19,070 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:09:19,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:19,074 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-04-26 16:09:19,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:09:19,076 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:09:19,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:09:19,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:19,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:19,084 INFO L229 MonitoredProcess]: Starting monitored process 20 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:09:19,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:09:19,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:19,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:19,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:09:19,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:19,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:09:19,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:19,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:09:19,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:09:19,096 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:09:19,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:09:19,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:19,103 INFO L229 MonitoredProcess]: Starting monitored process 21 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:09:19,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:09:19,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:19,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:19,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:19,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:09:19,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:19,116 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:09:19,116 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:09:19,119 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:09:19,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:09:19,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:19,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:19,130 INFO L229 MonitoredProcess]: Starting monitored process 22 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:09:19,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:09:19,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:19,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:19,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:09:19,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:19,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:09:19,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:19,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:09:19,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:09:19,147 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:09:19,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:09:19,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:19,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:19,155 INFO L229 MonitoredProcess]: Starting monitored process 23 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:09:19,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:09:19,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:19,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:19,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:09:19,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:19,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:09:19,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:19,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:09:19,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:09:19,168 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:09:19,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:09:19,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:19,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:19,176 INFO L229 MonitoredProcess]: Starting monitored process 24 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:09:19,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:09:19,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:09:19,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:09:19,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:09:19,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:09:19,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:09:19,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:09:19,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:09:19,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:09:19,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:09:19,194 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:09:19,194 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:09:19,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:09:19,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:09:19,197 INFO L229 MonitoredProcess]: Starting monitored process 25 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:09:19,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:09:19,199 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:09:19,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:09:19,204 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:09:19,204 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:09:19,204 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread2Thread1of1ForFork1_~i~1#1) = 1*~n_0~0 - 1*thread2Thread1of1ForFork1_~i~1#1 Supporting invariants [] [2025-04-26 16:09:19,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:09:19,213 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:09:19,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:09:19,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-26 16:09:19,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-26 16:09:19,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:19,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:09:19,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:09:19,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:09:19,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:09:19,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:09:19,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:09:19,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:09:19,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:09:19,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:09:19,494 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:09:19,495 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:09:19,495 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19140 states and 51432 transitions. cyclomatic complexity: 32503 Second operand has 5 states, 5 states have (on average 21.2) internal successors, (in total 106), 5 states have internal predecessors, (106), 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:09:19,811 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19140 states and 51432 transitions. cyclomatic complexity: 32503. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (in total 106), 5 states have internal predecessors, (106), 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) Result 47832 states and 131039 transitions. Complement of second has 9 states. [2025-04-26 16:09:19,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:09:19,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 21.2) internal successors, (in total 106), 5 states have internal predecessors, (106), 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:09:19,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 500 transitions. [2025-04-26 16:09:19,812 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 500 transitions. Stem has 56 letters. Loop has 50 letters. [2025-04-26 16:09:19,813 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:09:19,813 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 500 transitions. Stem has 106 letters. Loop has 50 letters. [2025-04-26 16:09:19,813 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:09:19,813 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 500 transitions. Stem has 56 letters. Loop has 100 letters. [2025-04-26 16:09:19,815 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:09:19,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47832 states and 131039 transitions. [2025-04-26 16:09:20,094 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:09:20,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47832 states to 0 states and 0 transitions. [2025-04-26 16:09:20,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:09:20,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:09:20,095 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:09:20,095 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:09:20,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:09:20,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:09:20,095 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:09:20,095 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:09:20,095 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:09:20,095 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:09:20,095 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:09:20,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:09:20 BoogieIcfgContainer [2025-04-26 16:09:20,100 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:09:20,100 INFO L158 Benchmark]: Toolchain (without parser) took 7195.62ms. Allocated memory was 155.2MB in the beginning and 662.7MB in the end (delta: 507.5MB). Free memory was 110.8MB in the beginning and 277.1MB in the end (delta: -166.3MB). Peak memory consumption was 340.4MB. Max. memory is 8.0GB. [2025-04-26 16:09:20,100 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:09:20,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.72ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 97.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:09:20,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.30ms. Allocated memory is still 155.2MB. Free memory was 97.3MB in the beginning and 95.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:09:20,101 INFO L158 Benchmark]: Boogie Preprocessor took 14.84ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 93.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:09:20,101 INFO L158 Benchmark]: RCFGBuilder took 300.47ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 76.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:09:20,101 INFO L158 Benchmark]: BuchiAutomizer took 6608.12ms. Allocated memory was 155.2MB in the beginning and 662.7MB in the end (delta: 507.5MB). Free memory was 76.3MB in the beginning and 277.1MB in the end (delta: -200.8MB). Peak memory consumption was 306.8MB. Max. memory is 8.0GB. [2025-04-26 16:09:20,102 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.67ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.72ms. Allocated memory is still 155.2MB. Free memory was 110.8MB in the beginning and 97.3MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.30ms. Allocated memory is still 155.2MB. Free memory was 97.3MB in the beginning and 95.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 14.84ms. Allocated memory is still 155.2MB. Free memory was 95.3MB in the beginning and 93.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 300.47ms. Allocated memory is still 155.2MB. Free memory was 93.6MB in the beginning and 76.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 6608.12ms. Allocated memory was 155.2MB in the beginning and 662.7MB in the end (delta: 507.5MB). Free memory was 76.3MB in the beginning and 277.1MB in the end (delta: -200.8MB). Peak memory consumption was 306.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.6s AutomataMinimizationTime, 1 MinimizatonAttempts, 681 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.7s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 796 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 1686 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 967 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 719 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital67 mio100 ax147 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq135 hnf94 smp100 dnf1109 smp13 tf101 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -1 * i) + n_0) and consists of 6 locations. One deterministic module has affine ranking function (n_0 + ((long long) -1 * i)) and consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:09:20,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...