/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:36:55,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:36:55,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:36:55,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:36:55,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:36:55,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:36:55,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:36:55,752 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:36:55,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:36:55,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:36:55,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:36:55,758 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:36:55,758 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:36:55,759 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:36:55,759 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:36:55,759 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:36:55,759 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:36:55,759 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:36:55,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:36:55,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:36:55,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:36:55,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:36:55,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:36:55,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:36:55,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:36:55,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:36:55,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:36:55,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:36:55,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:36:55,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:36:55,778 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:36:55,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:36:55,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:36:55,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:36:55,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:36:55,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:36:55,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:36:55,780 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:36:55,780 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:36:56,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:36:56,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:36:56,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:36:56,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 00:36:56,380 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 00:36:56,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2024-02-10 00:36:58,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 00:36:58,656 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 00:36:58,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2024-02-10 00:36:58,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0370bdef5/14e491e0f9ea46679fa72e2229be3c8d/FLAGd3b680e24 [2024-02-10 00:36:58,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0370bdef5/14e491e0f9ea46679fa72e2229be3c8d [2024-02-10 00:36:58,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:36:58,724 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 00:36:58,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 00:36:58,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 00:36:58,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 00:36:58,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:36:58" (1/1) ... [2024-02-10 00:36:58,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34425d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:58, skipping insertion in model container [2024-02-10 00:36:58,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 12:36:58" (1/1) ... [2024-02-10 00:36:58,797 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 00:36:59,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:36:59,148 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 00:36:59,207 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 00:36:59,234 INFO L206 MainTranslator]: Completed translation [2024-02-10 00:36:59,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59 WrapperNode [2024-02-10 00:36:59,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 00:36:59,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:36:59,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:36:59,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:36:59,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,348 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 161 [2024-02-10 00:36:59,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:36:59,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:36:59,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:36:59,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:36:59,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:36:59,420 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:36:59,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:36:59,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:36:59,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (1/1) ... [2024-02-10 00:36:59,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:36:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:36:59,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:36:59,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 00:36:59,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 00:36:59,611 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 00:36:59,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 00:36:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 00:36:59,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 00:36:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 00:36:59,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 00:36:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 00:36:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:36:59,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:36:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 00:36:59,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 00:36:59,623 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:36:59,885 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:36:59,888 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:37:00,377 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:37:00,390 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:37:00,392 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 00:37:00,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:37:00 BoogieIcfgContainer [2024-02-10 00:37:00,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:37:00,400 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:37:00,400 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:37:00,403 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:37:00,419 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:37:00,420 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 12:36:58" (1/3) ... [2024-02-10 00:37:00,421 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@574148c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:37:00, skipping insertion in model container [2024-02-10 00:37:00,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:37:00,421 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 12:36:59" (2/3) ... [2024-02-10 00:37:00,421 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@574148c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:37:00, skipping insertion in model container [2024-02-10 00:37:00,421 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:37:00,421 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:37:00" (3/3) ... [2024-02-10 00:37:00,423 INFO L332 chiAutomizerObserver]: Analyzing ICFG fibonacci.wvr.c [2024-02-10 00:37:00,626 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:37:00,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 218 transitions, 450 flow [2024-02-10 00:37:00,836 INFO L124 PetriNetUnfolderBase]: 14/214 cut-off events. [2024-02-10 00:37:00,837 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:37:00,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 214 events. 14/214 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 338 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2024-02-10 00:37:00,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 218 transitions, 450 flow [2024-02-10 00:37:00,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 214 transitions, 440 flow [2024-02-10 00:37:00,889 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:37:00,889 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:37:00,889 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:37:00,908 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:37:00,908 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:37:00,908 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:37:00,908 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:37:00,909 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:37:00,910 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 207 places, 214 transitions, 440 flow [2024-02-10 00:37:01,019 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:37:01,020 INFO L124 PetriNetUnfolderBase]: 12/205 cut-off events. [2024-02-10 00:37:01,020 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:37:01,020 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:37:01,045 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:37:01,046 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 207 places, 214 transitions, 440 flow [2024-02-10 00:37:01,090 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:37:01,090 INFO L124 PetriNetUnfolderBase]: 12/205 cut-off events. [2024-02-10 00:37:01,090 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:37:01,091 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:37:01,113 INFO L748 eck$LassoCheckResult]: Stem: 213#[$Ultimate##0]true [409] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_5| 0) 0) InVars {#valid=|v_#valid_5|} OutVars{#valid=|v_#valid_5|} AuxVars[] AssignedVars[] 215#[L-1]true [417] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 217#[L21]true [348] L21-->L21-1: Formula: (and (= (select |v_#valid_6| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_6|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[] 219#[L21-1]true [473] 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[] 221#[L21-2]true [427] 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[] 223#[L21-3]true [445] L21-3-->L21-4: Formula: (and (= (select |v_#valid_7| 2) 1) (= 16 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_7|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_7|} AuxVars[] AssignedVars[] 225#[L21-4]true [321] 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] 227#[L38]true [437] 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] 229#[L38-1]true [446] 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] 231#[L38-2]true [364] 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] 233#[L38-3]true [301] 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] 235#[L38-4]true [443] 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] 237#[L38-5]true [280] 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] 239#[L-1-1]true [481] 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] 241#[L-1-2]true [484] 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_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem18#1=|v_ULTIMATE.start_main_#t~mem18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#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.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~mem18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~mem19#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.base] 243#[L64]true [398] L64-->L64-1: Formula: (and (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= |v_#valid_8| (store |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_9|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 245#[L64-1]true [483] L64-1-->L64-2: Formula: (and (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_5|) (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1)) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 247#[L64-2]true [376] L64-2-->L67: 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] 249#[L67]true [476] L67-->L67-1: 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] 251#[L67-1]true [347] L67-1-->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] 253#[L68]true [480] 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] 255#[L68-1]true [346] 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] 257#[L68-2]true [337] 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] 259#[L69]true [286] 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] 261#[L69-1]true [366] 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] 263#[L69-2]true [459] 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] 265#[L70]true [323] 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] 267#[L70-1]true [406] 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] 269#[L70-2]true [405] 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] 271#[L71]true [334] 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] 273#[L71-1]true [400] 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] 275#[L71-2]true [365] 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] 277#[L72]true [322] 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] 279#[L72-1]true [440] 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] 281#[L72-2]true [383] 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] 283#[L73]true [349] 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] 285#[L73-1]true [467] 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] 287#[L73-2]true [297] 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] 289#[L76]true [324] L76-->L76-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| (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_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 291#[L76-1]true [471] L76-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 293#[L34]true [407] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|, 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_~cond#1] 295#[L35]true [475] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 297#[L34-1]true [468] 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_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 299#[L76-2]true [477] 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_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 301#[L78]true [289] 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] 303#[L78-1]true [345] 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] 305#[L78-2]true [422] L78-2-->L78-3: Formula: (and (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_6| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) |v_ULTIMATE.start_main_~#t1~0#1.offset_6| |v_ULTIMATE.start_main_#t~pre14#1_4|)) |v_#memory_int_3|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_6|) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_6|))) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} OutVars{ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_4|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|} AuxVars[] AssignedVars[#memory_int] 307#[L78-3]true [628] L78-3-->$Ultimate##0: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_8|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_8|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_8|, thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_14|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_8|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_8|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_14|, thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_8|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_26|, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_14|, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_4|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_14|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_14|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_4|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_8|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_42|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_8|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ret3#1, thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_#t~post1#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ret2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_~i~0#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_plus_~a#1, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_plus_#in~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork1_plus_#res#1] 309#[L78-4, $Ultimate##0]true [493] $Ultimate##0-->L44-5: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 311#[L44-5, L78-4]true [2024-02-10 00:37:01,115 INFO L750 eck$LassoCheckResult]: Loop: 311#[L44-5, L78-4]true [494] L44-5-->L45: Formula: (< |v_thread1Thread1of1ForFork1_~i~0#1_3| v_~n_0~0_2) InVars {~n_0~0=v_~n_0~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_3|} OutVars{~n_0~0=v_~n_0~0_2, thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_3|} AuxVars[] AssignedVars[] 314#[L45, L78-4]true [497] L45-->L45-1: Formula: (and (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_1| v_~f1_2~0_1) (= v_~f2_3~0_1 |v_thread1Thread1of1ForFork1_plus_#in~b#1_1|)) InVars {~f2_3~0=v_~f2_3~0_1, ~f1_2~0=v_~f1_2~0_1} OutVars{thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_1|, ~f1_2~0=v_~f1_2~0_1, ~f2_3~0=v_~f2_3~0_1, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_#in~b#1] 316#[L45-1, L78-4]true [499] L45-1-->L45-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_plus_#res#1] 318#[L45-2, L78-4]true [501] L45-2-->L95: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_1|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_~a#1] 320#[L95, L78-4]true [503] L95-->L95-1: Formula: (= |v_thread1Thread1of1ForFork1_plus_#in~a#1_3| |v_thread1Thread1of1ForFork1_plus_~a#1_3|) InVars {thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_3|} OutVars{thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_3|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_plus_~a#1] 322#[L95-1, L78-4]true [505] L95-1-->L96: Formula: (= |v_thread1Thread1of1ForFork1_plus_#in~b#1_3| |v_thread1Thread1of1ForFork1_plus_~b#1_3|) InVars {thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_3|} OutVars{thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_3|, thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_plus_~b#1] 324#[L96, L78-4]true [506] L96-->L96-1: Formula: (= (ite (or (<= 0 (+ |v_thread1Thread1of1ForFork1_plus_~a#1_5| |v_thread1Thread1of1ForFork1_plus_~b#1_5| 2147483648)) (<= 0 |v_thread1Thread1of1ForFork1_plus_~b#1_5|)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|) InVars {thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_5|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_5|} OutVars{thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_5|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 326#[L96-1, L78-4]true [507] L96-1-->L34: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 328#[L34, L78-4]true [508] L34-->L35: Formula: (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 330#[L35, L78-4]true [510] L35-->L34-1: Formula: (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7| 0)) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[] 332#[L34-1, L78-4]true [512] L34-1-->L96-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 334#[L96-2, L78-4]true [513] L96-2-->L97: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 336#[L78-4, L97]true [514] L97-->L97-1: Formula: (= (ite (or (<= (+ |v_thread1Thread1of1ForFork1_plus_~a#1_7| |v_thread1Thread1of1ForFork1_plus_~b#1_7|) 2147483647) (<= |v_thread1Thread1of1ForFork1_plus_~b#1_7| 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|) InVars {thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_7|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_7|} OutVars{thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_7|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 338#[L97-1, L78-4]true [515] L97-1-->L34-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 340#[L34-2, L78-4]true [516] L34-2-->L35-3: Formula: (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 342#[L78-4, L35-3]true [518] L35-3-->L34-3: Formula: (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_17| 0)) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[] 344#[L34-3, L78-4]true [520] L34-3-->L97-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 346#[L97-2, L78-4]true [521] L97-2-->L98: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 348#[L98, L78-4]true [522] L98-->plus_returnLabel#1: Formula: (= (+ |v_thread1Thread1of1ForFork1_plus_~a#1_9| |v_thread1Thread1of1ForFork1_plus_~b#1_9|) |v_thread1Thread1of1ForFork1_plus_#res#1_3|) InVars {thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_9|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_9|} OutVars{thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_9|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_9|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_plus_#res#1] 350#[plus_returnLabel#1, L78-4]true [523] plus_returnLabel#1-->L45-3: Formula: (= |v_thread1Thread1of1ForFork1_plus_#res#1_5| |v_thread1Thread1of1ForFork1_#t~ret2#1_1|) InVars {thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_5|} OutVars{thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_1|, thread1Thread1of1ForFork1_plus_#res#1=|v_thread1Thread1of1ForFork1_plus_#res#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret2#1] 352#[L78-4, L45-3]true [524] L45-3-->L45-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_plus_~b#1=|v_thread1Thread1of1ForFork1_plus_~b#1_11|, thread1Thread1of1ForFork1_plus_~a#1=|v_thread1Thread1of1ForFork1_plus_~a#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_plus_~b#1, thread1Thread1of1ForFork1_plus_~a#1] 354#[L45-4, L78-4]true [525] L45-4-->L45-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_plus_#in~b#1=|v_thread1Thread1of1ForFork1_plus_#in~b#1_5|, thread1Thread1of1ForFork1_plus_#in~a#1=|v_thread1Thread1of1ForFork1_plus_#in~a#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_plus_#in~a#1, thread1Thread1of1ForFork1_plus_#in~b#1] 356#[L45-5, L78-4]true [526] L45-5-->L45-6: Formula: (= |v_thread1Thread1of1ForFork1_#t~ret2#1_3| v_~f1_2~0_2) InVars {thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_3|} OutVars{thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_3|, ~f1_2~0=v_~f1_2~0_2} AuxVars[] AssignedVars[~f1_2~0] 358#[L78-4, L45-6]true [527] L45-6-->L46: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~ret2#1=|v_thread1Thread1of1ForFork1_#t~ret2#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret2#1] 360#[L46, L78-4]true [528] L46-->L46-1: Formula: (and (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_1| v_~f1_2~0_3) (= v_~f2_3~0_2 |v_thread1Thread1of1ForFork1_minus_#in~b#1_1|)) InVars {~f2_3~0=v_~f2_3~0_2, ~f1_2~0=v_~f1_2~0_3} OutVars{thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_1|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_1|, ~f1_2~0=v_~f1_2~0_3, ~f2_3~0=v_~f2_3~0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_#in~a#1] 362#[L46-1, L78-4]true [529] L46-1-->L46-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#res#1] 364#[L46-2, L78-4]true [530] L46-2-->L89: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_1|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_minus_~a#1] 366#[L78-4, L89]true [531] L89-->L89-1: Formula: (= |v_thread1Thread1of1ForFork1_minus_~a#1_3| |v_thread1Thread1of1ForFork1_minus_#in~a#1_3|) InVars {thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_3|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_3|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_~a#1] 368#[L89-1, L78-4]true [532] L89-1-->L90: Formula: (= |v_thread1Thread1of1ForFork1_minus_~b#1_3| |v_thread1Thread1of1ForFork1_minus_#in~b#1_3|) InVars {thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_3|} OutVars{thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_3|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_~b#1] 370#[L90, L78-4]true [533] L90-->L90-1: Formula: (= (ite (or (<= |v_thread1Thread1of1ForFork1_minus_~b#1_5| (+ |v_thread1Thread1of1ForFork1_minus_~a#1_5| 2147483648)) (<= |v_thread1Thread1of1ForFork1_minus_~b#1_5| 0)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|) InVars {thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_5|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_5|} OutVars{thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_5|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_5|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 372#[L90-1, L78-4]true [534] L90-1-->L34-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 374#[L34-4, L78-4]true [535] L34-4-->L35-6: Formula: (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 376#[L35-6, L78-4]true [537] L35-6-->L34-5: Formula: (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27| 0)) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_27|} AuxVars[] AssignedVars[] 378#[L34-5, L78-4]true [539] L34-5-->L90-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_29|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 380#[L90-2, L78-4]true [540] L90-2-->L91: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 382#[L91, L78-4]true [541] L91-->L91-1: Formula: (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_7|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_7| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_7| 2147483647))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|) InVars {thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_7|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_7|} OutVars{thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_7|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_7|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_19|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 384#[L78-4, L91-1]true [542] L91-1-->L34-6: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 386#[L34-6, L78-4]true [543] L34-6-->L35-9: Formula: (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 388#[L35-9, L78-4]true [545] L35-9-->L34-7: Formula: (not (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| 0)) InVars {thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|} AuxVars[] AssignedVars[] 390#[L34-7, L78-4]true [547] L34-7-->L91-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] 392#[L91-2, L78-4]true [548] L91-2-->L92: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1] 394#[L78-4, L92]true [549] L92-->minus_returnLabel#1: Formula: (= |v_thread1Thread1of1ForFork1_minus_~a#1_9| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_9| |v_thread1Thread1of1ForFork1_minus_#res#1_3|)) InVars {thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_9|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_9|} OutVars{thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_9|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_9|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#res#1] 396#[minus_returnLabel#1, L78-4]true [550] minus_returnLabel#1-->L46-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~ret3#1_1| |v_thread1Thread1of1ForFork1_minus_#res#1_5|) InVars {thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_5|} OutVars{thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_5|, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1] 398#[L46-3, L78-4]true [551] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_11|, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_minus_~a#1] 400#[L46-4, L78-4]true [552] L46-4-->L46-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_5|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_#in~a#1] 402#[L78-4, L46-5]true [553] L46-5-->L46-6: Formula: (= v_~f2_3~0_3 |v_thread1Thread1of1ForFork1_#t~ret3#1_3|) InVars {thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_3|} OutVars{~f2_3~0=v_~f2_3~0_3, thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_3|} AuxVars[] AssignedVars[~f2_3~0] 404#[L46-6, L78-4]true [554] L46-6-->L44-2: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~ret3#1=|v_thread1Thread1of1ForFork1_#t~ret3#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ret3#1] 406#[L44-2, L78-4]true [555] L44-2-->L44-3: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1#1_1| |v_thread1Thread1of1ForFork1_~i~0#1_9|) InVars {thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_9|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 408#[L78-4, L44-3]true [556] L44-3-->L44-4: Formula: (= |v_thread1Thread1of1ForFork1_~i~0#1_11| (+ |v_thread1Thread1of1ForFork1_#t~post1#1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} OutVars{thread1Thread1of1ForFork1_~i~0#1=|v_thread1Thread1of1ForFork1_~i~0#1_11|, thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0#1] 410#[L44-4, L78-4]true [557] L44-4-->L44-5: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1#1=|v_thread1Thread1of1ForFork1_#t~post1#1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1#1] 311#[L44-5, L78-4]true [2024-02-10 00:37:01,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:37:01,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1513377791, now seen corresponding path program 1 times [2024-02-10 00:37:01,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:37:01,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307033313] [2024-02-10 00:37:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:37:01,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:37:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:37:01,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:37:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:37:01,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:37:01,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:37:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1688026146, now seen corresponding path program 1 times [2024-02-10 00:37:01,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:37:01,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812205852] [2024-02-10 00:37:01,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:37:01,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:37:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:37:01,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:37:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:37:01,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:37:01,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:37:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash 102558754, now seen corresponding path program 1 times [2024-02-10 00:37:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:37:01,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967449640] [2024-02-10 00:37:01,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:37:01,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:37:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:37:01,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:37:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:37:01,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:37:02,517 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:37:02,518 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:37:02,518 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:37:02,518 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:37:02,518 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 00:37:02,519 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:02,519 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:37:02,519 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:37:02,520 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration1_Loop [2024-02-10 00:37:02,520 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:37:02,520 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:37:02,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:02,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:03,081 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:37:03,082 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 00:37:03,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:03,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:03,101 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:03,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 00:37:03,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:37:03,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:37:03,167 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:37:03,168 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_plus_~b#1=0} Honda state: {thread1Thread1of1ForFork1_plus_~b#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:37:03,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 00:37:03,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:03,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:03,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:03,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 00:37:03,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:37:03,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:37:03,276 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:37:03,277 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_minus_#in~a#1=0} Honda state: {thread1Thread1of1ForFork1_minus_#in~a#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:37:03,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:03,329 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:03,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:37:03,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:37:03,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 00:37:03,401 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:37:03,402 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_1=0} Honda state: {v_rep#funAddr~thread1.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:37:03,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:03,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:03,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:03,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:03,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:37:03,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:37:03,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 00:37:03,670 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:37:03,671 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f1_2~0=0, ~f2_3~0=0, thread1Thread1of1ForFork1_minus_#res#1=0, thread1Thread1of1ForFork1_plus_#res#1=0} Honda state: {~f1_2~0=0, ~f2_3~0=0, thread1Thread1of1ForFork1_minus_#res#1=0, thread1Thread1of1ForFork1_plus_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:37:03,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:03,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:03,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:03,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:03,690 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:37:03,690 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:37:03,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 00:37:03,729 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 00:37:03,730 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~ret2#1=0} Honda state: {thread1Thread1of1ForFork1_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 00:37:03,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:03,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:03,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:03,765 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:03,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 00:37:03,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:37:03,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 00:37:03,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:03,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:03,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:03,865 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:03,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 00:37:03,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 00:37:03,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 00:37:04,017 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 00:37:04,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:04,025 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:37:04,025 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:37:04,025 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:37:04,025 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:37:04,025 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:37:04,025 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:04,025 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:37:04,025 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:37:04,025 INFO L133 ssoRankerPreferences]: Filename of dumped script: fibonacci.wvr.c_BEv2_Iteration1_Loop [2024-02-10 00:37:04,026 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:37:04,026 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:37:04,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:37:04,534 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:37:04,538 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:37:04,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:04,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:04,557 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:04,571 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 [2024-02-10 00:37:04,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:37:04,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:37:04,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:37:04,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:37:04,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:37:04,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:37:04,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:37:04,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 00:37:04,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:37:04,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:04,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:04,694 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 [2024-02-10 00:37:04,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 00:37:04,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:37:04,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:37:04,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:37:04,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:37:04,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:37:04,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:37:04,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:37:04,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:37:04,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:04,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:04,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:04,750 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:04,759 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 [2024-02-10 00:37:04,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:37:04,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:37:04,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:37:04,766 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 00:37:04,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:37:04,775 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-02-10 00:37:04,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:37:04,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 00:37:04,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:37:04,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:04,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:04,828 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:04,834 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 [2024-02-10 00:37:04,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:37:04,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:37:04,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:37:04,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:37:04,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:37:04,847 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:37:04,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:37:04,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:37:04,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:04,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:04,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:04,917 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:04,925 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 [2024-02-10 00:37:04,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:37:04,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:37:04,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:37:04,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:37:04,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:37:04,935 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:37:04,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:37:04,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:37:04,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:37:04,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:04,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:04,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:04,957 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:04,962 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 [2024-02-10 00:37:04,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:37:04,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:37:04,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:37:04,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:37:04,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:37:04,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:37:04,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:37:04,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:37:05,010 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:37:05,025 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:37:05,025 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 00:37:05,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:37:05,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:37:05,045 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:37:05,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:37:05,076 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 00:37:05,076 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:37:05,077 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~n_0~0, thread1Thread1of1ForFork1_~i~0#1) = 1*~n_0~0 - 1*thread1Thread1of1ForFork1_~i~0#1 Supporting invariants [] [2024-02-10 00:37:05,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 00:37:05,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:05,094 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:37:05,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:37:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:37:05,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:37:05,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:37:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:37:05,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 00:37:05,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:37:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:37:05,771 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 [2024-02-10 00:37:05,774 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:37:06,220 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 3941 transitions.8 powerset states5 rank states. The highest rank that occured is 1 [2024-02-10 00:37:06,221 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:37:06,221 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:37:06,222 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:37:06,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 00:37:06,463 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:37:06,463 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:37:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-02-10 00:37:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:37:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1500 transitions. [2024-02-10 00:37:06,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 1500 transitions. Stem has 49 letters. Loop has 50 letters. [2024-02-10 00:37:06,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:37:06,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 1500 transitions. Stem has 99 letters. Loop has 50 letters. [2024-02-10 00:37:06,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:37:06,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 1500 transitions. Stem has 49 letters. Loop has 100 letters. [2024-02-10 00:37:06,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:37:06,512 INFO L428 stractBuchiCegarLoop]: Abstraction has has 220 places, 3865 transitions, 15661 flow [2024-02-10 00:37:06,512 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:37:06,513 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 220 places, 3865 transitions, 15661 flow Received shutdown request... [2024-02-10 00:41:52,909 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-10 00:41:53,056 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 00:41:53,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:41:53 BoogieIcfgContainer [2024-02-10 00:41:53,062 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:41:53,063 INFO L158 Benchmark]: Toolchain (without parser) took 294338.83ms. Allocated memory was 252.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 223.2MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2024-02-10 00:41:53,063 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 199.2MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:41:53,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.47ms. Allocated memory is still 252.7MB. Free memory was 222.8MB in the beginning and 211.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 00:41:53,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.40ms. Allocated memory is still 252.7MB. Free memory was 211.3MB in the beginning and 208.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-10 00:41:53,064 INFO L158 Benchmark]: Boogie Preprocessor took 70.49ms. Allocated memory is still 252.7MB. Free memory was 208.6MB in the beginning and 207.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:41:53,064 INFO L158 Benchmark]: RCFGBuilder took 973.83ms. Allocated memory is still 252.7MB. Free memory was 207.1MB in the beginning and 188.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2024-02-10 00:41:53,065 INFO L158 Benchmark]: BuchiAutomizer took 292662.96ms. Allocated memory was 252.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 188.7MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2024-02-10 00:41:53,066 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 199.2MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 513.47ms. Allocated memory is still 252.7MB. Free memory was 222.8MB in the beginning and 211.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 106.40ms. Allocated memory is still 252.7MB. Free memory was 211.3MB in the beginning and 208.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.49ms. Allocated memory is still 252.7MB. Free memory was 208.6MB in the beginning and 207.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 973.83ms. Allocated memory is still 252.7MB. Free memory was 207.1MB in the beginning and 188.7MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 292662.96ms. Allocated memory was 252.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 188.7MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function ((-1 * i) + n_0) and consists of 7 locations. The remainder module has 15661 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 292.4s and 2 iterations. TraceHistogramMax:0. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 997 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 996 mSDsluCounter, 2127 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1339 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 788 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital68 mio100 ax147 hnf100 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq134 hnf94 smp100 dnf1105 smp11 tf102 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.2s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown