/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs FAIRNESS_LAZY -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 12:09:53,170 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 12:09:53,213 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-17 12:09:53,243 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 12:09:53,243 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 12:09:53,244 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 12:09:53,245 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 12:09:53,245 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 12:09:53,245 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 12:09:53,248 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 12:09:53,248 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 12:09:53,248 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 12:09:53,248 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 12:09:53,249 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 12:09:53,250 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 12:09:53,250 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 12:09:53,250 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 12:09:53,250 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 12:09:53,250 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 12:09:53,251 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 12:09:53,251 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 12:09:53,252 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 12:09:53,252 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 12:09:53,252 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 12:09:53,252 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 12:09:53,252 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 12:09:53,253 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 12:09:53,253 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 12:09:53,253 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 12:09:53,253 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 12:09:53,254 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 12:09:53,254 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 12:09:53,254 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 12:09:53,254 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 12:09:53,255 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 12:09:53,255 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> FAIRNESS_LAZY [2023-09-17 12:09:53,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 12:09:53,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 12:09:53,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 12:09:53,461 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 12:09:53,462 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 12:09:53,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2023-09-17 12:09:54,499 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 12:09:54,669 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 12:09:54,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2023-09-17 12:09:54,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4926d51/8e31cbf7bfa34b69973e5967f4e00198/FLAG4a10cce2f [2023-09-17 12:09:54,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4926d51/8e31cbf7bfa34b69973e5967f4e00198 [2023-09-17 12:09:54,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 12:09:54,694 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 12:09:54,697 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 12:09:54,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 12:09:54,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 12:09:54,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:54,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b73478f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54, skipping insertion in model container [2023-09-17 12:09:54,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:54,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 12:09:54,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 12:09:54,880 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2382,2395] [2023-09-17 12:09:54,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:09:54,899 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 12:09:54,928 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c[2382,2395] [2023-09-17 12:09:54,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:09:54,944 INFO L208 MainTranslator]: Completed translation [2023-09-17 12:09:54,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54 WrapperNode [2023-09-17 12:09:54,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 12:09:54,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 12:09:54,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 12:09:54,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 12:09:54,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:54,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:54,980 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 129 [2023-09-17 12:09:54,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 12:09:54,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 12:09:54,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 12:09:54,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 12:09:54,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:54,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:54,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:54,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:54,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:54,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:55,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:55,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:55,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 12:09:55,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 12:09:55,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 12:09:55,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 12:09:55,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (1/1) ... [2023-09-17 12:09:55,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:09:55,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:09:55,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-09-17 12:09:55,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-09-17 12:09:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 12:09:55,056 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 12:09:55,056 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 12:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 12:09:55,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 12:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 12:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 12:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 12:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-17 12:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 12:09:55,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 12:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-17 12:09:55,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 12:09:55,058 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 12:09:55,133 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 12:09:55,135 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 12:09:55,295 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 12:09:55,301 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 12:09:55,301 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-17 12:09:55,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:09:55 BoogieIcfgContainer [2023-09-17 12:09:55,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 12:09:55,304 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 12:09:55,307 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 12:09:55,310 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 12:09:55,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:09:55,310 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 12:09:54" (1/3) ... [2023-09-17 12:09:55,311 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64227bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:09:55, skipping insertion in model container [2023-09-17 12:09:55,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:09:55,312 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:09:54" (2/3) ... [2023-09-17 12:09:55,312 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@64227bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:09:55, skipping insertion in model container [2023-09-17 12:09:55,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:09:55,312 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:09:55" (3/3) ... [2023-09-17 12:09:55,313 INFO L332 chiAutomizerObserver]: Analyzing ICFG unroll-2.wvr.c [2023-09-17 12:09:55,396 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 12:09:55,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 149 transitions, 308 flow [2023-09-17 12:09:55,478 INFO L124 PetriNetUnfolderBase]: 14/145 cut-off events. [2023-09-17 12:09:55,479 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 12:09:55,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 145 events. 14/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-09-17 12:09:55,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 149 transitions, 308 flow [2023-09-17 12:09:55,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 145 transitions, 296 flow [2023-09-17 12:09:55,499 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 12:09:55,499 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 12:09:55,500 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 12:09:55,500 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 12:09:55,500 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 12:09:55,500 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 12:09:55,500 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 12:09:55,500 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 12:09:55,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:10:03,895 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1020 [2023-09-17 12:10:03,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:10:03,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:10:03,903 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:10:03,903 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:10:03,903 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 12:10:03,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:10:09,197 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1020 [2023-09-17 12:10:09,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:10:09,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:10:09,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:10:09,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:10:09,204 INFO L748 eck$LassoCheckResult]: Stem: SleepPredicate [underlying: 143#[$Ultimate##0]don't care, sleep set: []] [227] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] SleepPredicate [underlying: 146#[L-1]don't care, sleep set: []] [235] L-1-->L-1-1: Formula: (= 0 (select |v_#valid_13| 0)) InVars {#valid=|v_#valid_13|} OutVars{#valid=|v_#valid_13|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 148#[L-1-1]don't care, sleep set: []] [340] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 150#[L21]don't care, sleep set: []] [304] L21-->L21-1: Formula: (and (= (select |v_#length_9| 1) 2) (= (select |v_#valid_14| 1) 1)) InVars {#length=|v_#length_9|, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, #valid=|v_#valid_14|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 152#[L21-1]don't care, sleep set: []] [331] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_10| 1) 0)) InVars {#memory_int=|v_#memory_int_10|} OutVars{#memory_int=|v_#memory_int_10|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 154#[L21-2]don't care, sleep set: []] [242] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_11| 1) 1) 0) InVars {#memory_int=|v_#memory_int_11|} OutVars{#memory_int=|v_#memory_int_11|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 156#[L21-3]don't care, sleep set: []] [288] L21-3-->L21-4: Formula: (and (= (select |v_#valid_15| 2) 1) (= 15 (select |v_#length_10| 2))) InVars {#length=|v_#length_10|, #valid=|v_#valid_15|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 158#[L21-4]don't care, sleep set: []] [264] L21-4-->L42: Formula: (and (= v_~f~0.offset_5 0) (= v_~f~0.base_5 0)) InVars {} OutVars{~f~0.base=v_~f~0.base_5, ~f~0.offset=v_~f~0.offset_5} AuxVars[] AssignedVars[~f~0.base, ~f~0.offset] SleepPredicate [underlying: 160#[L42]don't care, sleep set: []] [253] L42-->L42-1: Formula: (= v_~x1~0_5 0) InVars {} OutVars{~x1~0=v_~x1~0_5} AuxVars[] AssignedVars[~x1~0] SleepPredicate [underlying: 162#[L42-1]don't care, sleep set: []] [333] L42-1-->L42-2: Formula: (= v_~x2~0_8 0) InVars {} OutVars{~x2~0=v_~x2~0_8} AuxVars[] AssignedVars[~x2~0] SleepPredicate [underlying: 164#[L42-2]don't care, sleep set: []] [262] L42-2-->L43: Formula: (= 0 v_~size~0_4) InVars {} OutVars{~size~0=v_~size~0_4} AuxVars[] AssignedVars[~size~0] SleepPredicate [underlying: 166#[L43]don't care, sleep set: []] [335] L43-->L-1-2: Formula: (= v_~n~0_6 0) InVars {} OutVars{~n~0=v_~n~0_6} AuxVars[] AssignedVars[~n~0] SleepPredicate [underlying: 168#[L-1-2]don't care, sleep set: []] [344] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] SleepPredicate [underlying: 170#[L-1-3]don't care, sleep set: []] [350] L-1-3-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_4|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|, ULTIMATE.start_main_#t~ret9#1.offset=|v_ULTIMATE.start_main_#t~ret9#1.offset_4|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~ret9#1.base=|v_ULTIMATE.start_main_#t~ret9#1.base_4|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_4|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~ret9#1.base, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 172#[L71]don't care, sleep set: []] [277] L71-->L71-1: Formula: (and (= (select |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (= (store |v_#valid_17| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_16|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4) |v_#length_11|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_12|, #valid=|v_#valid_17|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_11|, 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_16|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] SleepPredicate [underlying: 174#[L71-1]don't care, sleep set: []] [220] L71-1-->L71-2: Formula: (and (= |v_#valid_18| (store |v_#valid_19| |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|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_13|) (= (select |v_#valid_19| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_14|, #valid=|v_#valid_19|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_13|, 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_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 176#[L71-2]don't care, sleep set: []] [343] L71-2-->L74: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] SleepPredicate [underlying: 178#[L74]don't care, sleep set: []] [276] L74-->L74-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet7#1_3| v_~n~0_7) InVars {ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} OutVars{~n~0=v_~n~0_7, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[~n~0] SleepPredicate [underlying: 180#[L74-1]don't care, sleep set: []] [306] L74-1-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] SleepPredicate [underlying: 182#[L75]don't care, sleep set: []] [257] L75-->L75-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] SleepPredicate [underlying: 184#[L75-1]don't care, sleep set: []] [226] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| v_~size~0_5) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{~size~0=v_~size~0_5, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} AuxVars[] AssignedVars[~size~0] SleepPredicate [underlying: 186#[L75-2]don't care, sleep set: []] [329] L75-2-->L76: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] SleepPredicate [underlying: 188#[L76]don't care, sleep set: []] [268] L76-->L76-1: Formula: (= (ite (< 0 v_~size~0_6) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|) InVars {~size~0=v_~size~0_6} OutVars{~size~0=v_~size~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] SleepPredicate [underlying: 190#[L76-1]don't care, sleep set: []] [328] L76-1-->L37: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_13|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 192#[L37]don't care, sleep set: []] [255] L37-->L38: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 194#[L38]don't care, sleep set: []] [266] L38-->L37-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_16| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_16|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 198#[L37-1]don't care, sleep set: []] [256] L37-1-->L77: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~size~0_7) InVars {~size~0=v_~size~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~size~0=v_~size~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1] SleepPredicate [underlying: 200#[L77]don't care, sleep set: []] [281] L77-->L77-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base] SleepPredicate [underlying: 202#[L77-1]don't care, sleep set: []] [292] L77-1-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_4|, ULTIMATE.start_create_fresh_int_array_#t~nondet16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet16#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post15#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet16#1, ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1] SleepPredicate [underlying: 204#[L91]don't care, sleep set: []] [221] L91-->L92: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_6| |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|) InVars {ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_2|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1] SleepPredicate [underlying: 206#[L92]don't care, sleep set: []] [319] L92-->L92-1: Formula: (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_7|) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] SleepPredicate [underlying: 208#[L92-1]don't care, sleep set: []] [310] L92-1-->L37-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 210#[L37-2]don't care, sleep set: []] [217] L37-2-->L38-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_18| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_18|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 212#[L38-3]don't care, sleep set: []] [233] L38-3-->L37-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_20| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_20|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 216#[L37-3]don't care, sleep set: []] [228] L37-3-->L93: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_1| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] SleepPredicate [underlying: 218#[L93]don't care, sleep set: []] [231] L93-->L37-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 220#[L37-4]don't care, sleep set: []] [318] L37-4-->L38-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 222#[L38-6]don't care, sleep set: []] [302] L38-6-->L37-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 226#[L37-5]don't care, sleep set: []] [284] L37-5-->L95: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 228#[L95]don't care, sleep set: []] [293] L95-->L95-1: Formula: (and (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| |v_#StackHeapBarrier_1|) (= (select |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| 1) |v_#valid_4|) (= (store |v_#length_5| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| 1073741824))) |v_#length_4|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_1|, #valid=|v_#valid_4|, #length=|v_#length_4|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base, #valid, #length] SleepPredicate [underlying: 230#[L95-1]don't care, sleep set: []] [308] L95-1-->L95-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base] SleepPredicate [underlying: 232#[L95-2]don't care, sleep set: []] [309] L95-2-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc14#1.base] SleepPredicate [underlying: 234#[L96]don't care, sleep set: []] [320] L96-->L96-6: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] SleepPredicate [underlying: 236#[L96-6]don't care, sleep set: []] [2023-09-17 12:10:09,205 INFO L750 eck$LassoCheckResult]: Loop: SleepPredicate [underlying: 236#[L96-6]don't care, sleep set: []] [210] L96-6-->L97: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_3|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 238#[L97]don't care, sleep set: []] [279] L97-->L97-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet16#1] SleepPredicate [underlying: 242#[L97-1]don't care, sleep set: []] [287] L97-1-->L97-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1))) (and (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| .cse1 4) (select |v_#length_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|)) (= (store |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2| (store (select |v_#memory_int_5| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet16#1_2|)) |v_#memory_int_4|) (= (select |v_#valid_6| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet16#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_5|, #length=|v_#length_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|, ULTIMATE.start_create_fresh_int_array_#t~nondet16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet16#1_2|, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_4|} AuxVars[] AssignedVars[#memory_int] SleepPredicate [underlying: 246#[L97-2]don't care, sleep set: []] [338] L97-2-->L96-3: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet16#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet16#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet16#1] SleepPredicate [underlying: 250#[L96-3]don't care, sleep set: []] [236] L96-3-->L96-4: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1| |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_1|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1] SleepPredicate [underlying: 254#[L96-4]don't care, sleep set: []] [295] L96-4-->L96-5: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_2|, ULTIMATE.start_create_fresh_int_array_~i~2#1=|v_ULTIMATE.start_create_fresh_int_array_~i~2#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~2#1] SleepPredicate [underlying: 258#[L96-5]don't care, sleep set: []] [311] L96-5-->L96-6: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post15#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post15#1] SleepPredicate [underlying: 236#[L96-6]don't care, sleep set: []] [2023-09-17 12:10:09,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:10:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1727595094, now seen corresponding path program 1 times [2023-09-17 12:10:09,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:10:09,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324663144] [2023-09-17 12:10:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:10:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:10:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:09,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:10:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:09,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:10:09,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:10:09,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1187023005, now seen corresponding path program 1 times [2023-09-17 12:10:09,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:10:09,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604308471] [2023-09-17 12:10:09,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:10:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:10:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:09,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:10:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:09,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:10:09,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:10:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2017729390, now seen corresponding path program 1 times [2023-09-17 12:10:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:10:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701390706] [2023-09-17 12:10:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:10:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:10:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:09,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:10:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:10:09,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:10:10,356 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 12:10:10,357 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 12:10:10,358 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 12:10:10,358 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 12:10:10,358 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 12:10:10,358 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:10:10,358 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 12:10:10,359 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 12:10:10,359 INFO L133 ssoRankerPreferences]: Filename of dumped script: unroll-2.wvr.c_BEv2_Iteration1_Lasso [2023-09-17 12:10:10,359 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 12:10:10,359 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 12:10:10,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:10,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:10:11,142 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 12:10:11,145 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 12:10:11,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:10:11,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:10:11,150 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) [2023-09-17 12:10:11,160 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 [2023-09-17 12:10:11,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:10:11,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 12:10:11,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:10:11,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:10:11,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:10:11,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 12:10:11,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 12:10:11,174 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 [2023-09-17 12:10:11,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-09-17 12:10:11,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-09-17 12:10:11,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:10:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:10:11,198 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) [2023-09-17 12:10:11,201 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 [2023-09-17 12:10:11,202 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 [2023-09-17 12:10:11,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:10:11,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:10:11,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:10:11,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:10:11,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-09-17 12:10:11,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-09-17 12:10:11,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 12:10:11,279 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-09-17 12:10:11,279 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2023-09-17 12:10:11,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:10:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:10:11,327 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) [2023-09-17 12:10:11,328 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 [2023-09-17 12:10:11,330 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 12:10:11,351 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-09-17 12:10:11,351 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 12:10:11,352 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~2#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2023-09-17 12:10:11,358 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 [2023-09-17 12:10:11,396 INFO L156 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2023-09-17 12:10:11,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:10:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:10:11,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-09-17 12:10:11,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:10:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:10:11,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-17 12:10:11,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:10:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 12:10:11,572 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 [2023-09-17 12:10:11,574 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 12:10:11,853 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 [2023-09-17 12:10:20,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 96519 states and 310685 transitions. Complement of second has 9 states. [2023-09-17 12:10:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-09-17 12:10:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 12:10:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 258 transitions. [2023-09-17 12:10:20,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 258 transitions. Stem has 43 letters. Loop has 7 letters. [2023-09-17 12:10:20,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:10:20,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 258 transitions. Stem has 50 letters. Loop has 7 letters. [2023-09-17 12:10:21,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:10:21,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 258 transitions. Stem has 43 letters. Loop has 14 letters. [2023-09-17 12:10:21,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:10:21,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96519 states and 310685 transitions. [2023-09-17 12:10:21,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:10:21,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96519 states to 0 states and 0 transitions. [2023-09-17 12:10:21,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 12:10:21,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 12:10:21,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 12:10:21,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 12:10:21,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:10:21,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:10:21,900 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:10:21,900 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 12:10:21,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 12:10:21,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:10:21,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 12:10:21,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 12:10:21 BoogieIcfgContainer [2023-09-17 12:10:21,906 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 12:10:21,906 INFO L158 Benchmark]: Toolchain (without parser) took 27211.84ms. Allocated memory was 241.2MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 194.9MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 772.5MB. Max. memory is 8.0GB. [2023-09-17 12:10:21,906 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 241.2MB. Free memory was 195.0MB in the beginning and 194.9MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 12:10:21,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.46ms. Allocated memory is still 241.2MB. Free memory was 194.6MB in the beginning and 183.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 12:10:21,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.92ms. Allocated memory is still 241.2MB. Free memory was 183.4MB in the beginning and 181.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 12:10:21,907 INFO L158 Benchmark]: Boogie Preprocessor took 21.68ms. Allocated memory is still 241.2MB. Free memory was 181.3MB in the beginning and 179.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 12:10:21,908 INFO L158 Benchmark]: RCFGBuilder took 299.95ms. Allocated memory is still 241.2MB. Free memory was 179.9MB in the beginning and 163.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-09-17 12:10:21,908 INFO L158 Benchmark]: BuchiAutomizer took 26601.71ms. Allocated memory was 241.2MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 163.8MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 741.0MB. Max. memory is 8.0GB. [2023-09-17 12:10:21,910 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 241.2MB. Free memory was 195.0MB in the beginning and 194.9MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.46ms. Allocated memory is still 241.2MB. Free memory was 194.6MB in the beginning and 183.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.92ms. Allocated memory is still 241.2MB. Free memory was 183.4MB in the beginning and 181.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.68ms. Allocated memory is still 241.2MB. Free memory was 181.3MB in the beginning and 179.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 299.95ms. Allocated memory is still 241.2MB. Free memory was 179.9MB in the beginning and 163.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 26601.71ms. Allocated memory was 241.2MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 163.8MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 741.0MB. 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). One deterministic module has affine ranking function size + -1 * i and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 9.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.8s 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, 129 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 335 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 119 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital204 mio100 ax115 hnf100 lsp73 ukn73 mio100 lsp40 div242 bol100 ite100 ukn100 eq147 hnf94 smp60 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 154ms VariablesStem: 10 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-09-17 12:10:21,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...