/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:14:01,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:14:01,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:14:01,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:14:01,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:14:01,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:14:01,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:14:01,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:14:01,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:14:01,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:14:01,641 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:14:01,641 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:14:01,641 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:14:01,641 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:14:01,641 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:14:01,641 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:14:01,641 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:14:01,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:14:01,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:14:01,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:14:01,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:14:01,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:14:01,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:14:01,643 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:14:01,643 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:14:01,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:14:01,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:14:01,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:14:01,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:14:01,908 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:14:01,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2025-04-26 16:14:03,200 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e86b4d5ec/a667a8b1f50a4cb1817ce4cffff7e7c1/FLAG8606be5aa [2025-04-26 16:14:03,382 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:14:03,382 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2025-04-26 16:14:03,388 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e86b4d5ec/a667a8b1f50a4cb1817ce4cffff7e7c1/FLAG8606be5aa [2025-04-26 16:14:04,250 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e86b4d5ec/a667a8b1f50a4cb1817ce4cffff7e7c1 [2025-04-26 16:14:04,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:14:04,253 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:14:04,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:14:04,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:14:04,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:14:04,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46fa3cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04, skipping insertion in model container [2025-04-26 16:14:04,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:14:04,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:14:04,452 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:14:04,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:14:04,514 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:14:04,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04 WrapperNode [2025-04-26 16:14:04,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:14:04,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:14:04,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:14:04,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:14:04,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,546 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2025-04-26 16:14:04,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:14:04,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:14:04,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:14:04,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:14:04,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:14:04,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:14:04,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:14:04,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:14:04,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (1/1) ... [2025-04-26 16:14:04,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:04,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:04,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:04,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:14:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:14:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:14:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:14:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:14:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:14:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:14:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:14:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:14:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 16:14:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-26 16:14:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-26 16:14:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-26 16:14:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:14:04,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:14:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 16:14:04,645 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:14:04,720 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:14:04,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:14:04,945 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:14:04,945 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:14:05,007 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:14:05,008 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:14:05,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:14:05 BoogieIcfgContainer [2025-04-26 16:14:05,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:14:05,009 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:14:05,009 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:14:05,013 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:14:05,014 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:14:05,014 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:14:04" (1/3) ... [2025-04-26 16:14:05,015 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d30a41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:14:05, skipping insertion in model container [2025-04-26 16:14:05,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:14:05,015 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:14:04" (2/3) ... [2025-04-26 16:14:05,015 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d30a41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:14:05, skipping insertion in model container [2025-04-26 16:14:05,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:14:05,015 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:14:05" (3/3) ... [2025-04-26 16:14:05,016 INFO L376 chiAutomizerObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2025-04-26 16:14:05,067 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:14:05,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 146 transitions, 313 flow [2025-04-26 16:14:05,145 INFO L116 PetriNetUnfolderBase]: 8/140 cut-off events. [2025-04-26 16:14:05,147 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:14:05,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 8/140 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2025-04-26 16:14:05,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 146 transitions, 313 flow [2025-04-26 16:14:05,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 140 transitions, 298 flow [2025-04-26 16:14:05,158 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 142 places, 140 transitions, 298 flow [2025-04-26 16:14:05,167 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:14:05,167 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:14:05,167 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:14:05,168 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:14:05,168 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:14:05,168 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:14:05,168 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:14:05,168 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:14:05,169 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:14:05,729 INFO L131 ngComponentsAnalysis]: Automaton has 480 accepting balls. 3982 [2025-04-26 16:14:05,730 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:14:05,730 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:14:05,735 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] [2025-04-26 16:14:05,735 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:14:05,735 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:14:05,735 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 5002 states, but on-demand construction may add more states [2025-04-26 16:14:05,798 INFO L131 ngComponentsAnalysis]: Automaton has 480 accepting balls. 3982 [2025-04-26 16:14:05,798 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:14:05,798 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:14:05,800 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] [2025-04-26 16:14:05,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:14:05,806 INFO L752 eck$LassoCheckResult]: Stem: "[269] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[279] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[332] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[360] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[290] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[323] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[304] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[266] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[280] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[292] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[358] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[359] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[373] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[375] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[328] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[249] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[377] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[276] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[294] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[244] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[242] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[315] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[381] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[295] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[248] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[245] L87-2-->L105: Formula: true InVars {} 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~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, 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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[253] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |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_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[361] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[352] L106-1-->L36: 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]" "[370] L36-->L37: 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]" "[298] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[357] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[293] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[371] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[366] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[344] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[273] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[313] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[367] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} 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_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#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]" "[372] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[311] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" [2025-04-26 16:14:05,806 INFO L754 eck$LassoCheckResult]: Loop: "[257] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[255] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[354] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[333] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[282] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[319] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[263] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" [2025-04-26 16:14:05,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash -599193835, now seen corresponding path program 1 times [2025-04-26 16:14:05,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:05,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54346659] [2025-04-26 16:14:05,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:05,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:05,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:14:05,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:14:05,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:05,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:05,907 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:05,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:14:05,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:14:05,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:05,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:05,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:05,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1245616568, now seen corresponding path program 1 times [2025-04-26 16:14:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:05,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127323715] [2025-04-26 16:14:05,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:05,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:14:05,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:14:05,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:05,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:05,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:05,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:14:05,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:14:05,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:05,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:05,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:05,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:05,963 INFO L85 PathProgramCache]: Analyzing trace with hash -5819356, now seen corresponding path program 1 times [2025-04-26 16:14:05,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:05,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073042730] [2025-04-26 16:14:05,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:05,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:14:05,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:14:05,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:05,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:05,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:06,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-26 16:14:06,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-26 16:14:06,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:06,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:06,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:06,415 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:14:06,416 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:14:06,416 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:14:06,416 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:14:06,416 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:14:06,416 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:06,416 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:14:06,416 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:14:06,416 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array-hom.wvr.c_petrified1_Iteration1_Lasso [2025-04-26 16:14:06,416 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:14:06,417 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:14:06,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:06,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:07,136 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:14:07,139 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:14:07,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:14:07,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:07,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:07,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:07,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:07,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:07,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:07,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:07,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:07,165 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:07,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:14:07,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:14:07,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:07,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:07,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:07,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:07,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:07,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:07,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:07,197 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:07,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:14:07,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:14:07,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:07,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:07,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:07,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:07,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:07,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:07,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:07,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:07,223 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:07,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:07,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:14:07,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:07,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:07,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:07,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:07,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:07,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:07,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:07,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:07,250 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:07,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:14:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:14:07,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:07,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:07,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:07,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:07,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:07,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:07,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:07,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:07,276 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:07,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:14:07,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,284 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:14:07,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:07,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:07,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:07,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:07,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:07,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:07,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:07,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:07,302 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:07,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:14:07,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,310 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:14:07,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:07,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:07,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:07,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:07,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:07,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:07,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:07,331 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:07,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:07,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,339 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:14:07,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:07,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:07,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:07,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:07,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:07,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:07,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:07,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:07,355 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:07,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:14:07,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,363 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:14:07,364 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:07,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:07,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:07,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:07,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:07,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:07,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:07,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:14:07,410 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 16:14:07,410 INFO L437 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:14:07,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:07,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:07,415 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:07,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:14:07,417 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:14:07,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:14:07,434 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:14:07,434 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:14:07,435 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_~size#1) = -1*ULTIMATE.start_create_fresh_int_array_~i~3#1 + 1*ULTIMATE.start_create_fresh_int_array_~size#1 Supporting invariants [] [2025-04-26 16:14:07,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:14:07,452 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-04-26 16:14:07,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:07,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:14:07,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:14:07,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:07,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:07,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:14:07,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:14:07,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:14:07,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:14:07,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:07,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:07,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:14:07,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:14:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:14:07,646 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:14:07,648 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 5002 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 10.0) internal successors, (in total 50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:07,896 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 5002 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (in total 50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9985 states and 34835 transitions. Complement of second has 10 states. [2025-04-26 16:14:07,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:14:07,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.0) internal successors, (in total 50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2025-04-26 16:14:07,910 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 164 transitions. Stem has 43 letters. Loop has 7 letters. [2025-04-26 16:14:07,911 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:07,911 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 164 transitions. Stem has 50 letters. Loop has 7 letters. [2025-04-26 16:14:07,911 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:07,911 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 164 transitions. Stem has 43 letters. Loop has 14 letters. [2025-04-26 16:14:07,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:07,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9985 states and 34835 transitions. [2025-04-26 16:14:08,028 INFO L131 ngComponentsAnalysis]: Automaton has 479 accepting balls. 3975 [2025-04-26 16:14:08,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9985 states to 4776 states and 16650 transitions. [2025-04-26 16:14:08,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4767 [2025-04-26 16:14:08,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4769 [2025-04-26 16:14:08,106 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4776 states and 16650 transitions. [2025-04-26 16:14:08,120 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:14:08,120 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4776 states and 16650 transitions. [2025-04-26 16:14:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4776 states and 16650 transitions. [2025-04-26 16:14:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4776 to 4775. [2025-04-26 16:14:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4775 states, 4775 states have (on average 3.486701570680628) internal successors, (in total 16649), 4774 states have internal predecessors, (16649), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4775 states to 4775 states and 16649 transitions. [2025-04-26 16:14:08,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4775 states and 16649 transitions. [2025-04-26 16:14:08,353 INFO L438 stractBuchiCegarLoop]: Abstraction has 4775 states and 16649 transitions. [2025-04-26 16:14:08,353 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:14:08,353 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4775 states and 16649 transitions. [2025-04-26 16:14:08,383 INFO L131 ngComponentsAnalysis]: Automaton has 479 accepting balls. 3975 [2025-04-26 16:14:08,384 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:14:08,384 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:14:08,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:14:08,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:14:08,389 INFO L752 eck$LassoCheckResult]: Stem: "[269] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[279] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[332] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[360] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[290] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[323] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[304] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[266] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[280] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[292] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[358] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[359] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[373] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[375] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[328] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[249] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[377] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[276] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[294] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[244] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[242] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[315] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[381] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[295] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[248] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[245] L87-2-->L105: Formula: true InVars {} 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~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, 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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[253] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |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_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[361] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[352] L106-1-->L36: 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]" "[370] L36-->L37: 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]" "[298] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[357] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[293] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[371] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[366] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[344] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[273] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[313] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[367] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} 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_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#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]" "[372] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[311] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[256] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, 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_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[259] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[353] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[356] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[258] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[274] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[305] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[254] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[312] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, 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]" "[291] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[265] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) 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_12|, 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]" "[310] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[287] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[322] L89-2-->L92: Formula: true InVars {} OutVars{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]" "[350] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[338] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[302] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[423] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[382] $Ultimate##0-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_1| v_thread1Thread1of1ForFork2_~_argptr.offset_1) (= v_thread1Thread1of1ForFork2_~_argptr.base_1 |v_thread1Thread1of1ForFork2_#in~_argptr.base_1|)) InVars {thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_1, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_1, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_~_argptr.offset]" "[383] L46-->L46-4: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" [2025-04-26 16:14:08,389 INFO L754 eck$LassoCheckResult]: Loop: "[385] L46-4-->L47: Formula: (< v_thread1Thread1of1ForFork2_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[387] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork2_~i~0_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_41))) (let ((.cse0 (<= 0 .cse4)) (.cse1 (<= (+ .cse5 v_~A~0.offset_41 4) (select |v_#length_44| v_~A~0.base_41))) (.cse3 (= (select |v_#valid_45| v_~A~0.base_41) 1))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_43| v_~A~0.base_41) .cse4))) (or (and (<= .cse2 v_~max1~0_25) (= v_~max1~0_25 v_~max1~0_24) (= |v_thread1Thread1of1ForFork2_#t~mem2_2| |v_thread1Thread1of1ForFork2_#t~mem2_1|)) (and (= v_~max1~0_24 .cse2) .cse0 .cse1 (< v_~max1~0_25 .cse2) .cse3))) .cse3)))) InVars {~max1~0=v_~max1~0_25, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} OutVars{~max1~0=v_~max1~0_24, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_2|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2]" "[389] L51-->L46-2: Formula: (= |v_thread1Thread1of1ForFork2_#t~post3_1| v_thread1Thread1of1ForFork2_~i~0_11) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[391] L46-2-->L46-3: Formula: (= (+ |v_thread1Thread1of1ForFork2_#t~post3_3| 1) v_thread1Thread1of1ForFork2_~i~0_13) InVars {thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[392] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" [2025-04-26 16:14:08,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:08,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1215600287, now seen corresponding path program 1 times [2025-04-26 16:14:08,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:08,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156589057] [2025-04-26 16:14:08,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:08,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:08,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-26 16:14:08,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-26 16:14:08,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:08,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:08,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:14:08,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:14:08,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156589057] [2025-04-26 16:14:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156589057] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:14:08,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:14:08,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-26 16:14:08,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957178932] [2025-04-26 16:14:08,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:14:08,715 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:14:08,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash 396100195, now seen corresponding path program 1 times [2025-04-26 16:14:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:08,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792305008] [2025-04-26 16:14:08,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:08,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:08,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:08,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:08,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:08,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:08,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:08,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:08,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:08,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:08,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:08,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:14:08,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:14:08,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:14:08,858 INFO L87 Difference]: Start difference. First operand 4775 states and 16649 transitions. cyclomatic complexity: 12354 Second operand has 8 states, 8 states have (on average 7.875) internal successors, (in total 63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:14:09,079 INFO L93 Difference]: Finished difference Result 4792 states and 16664 transitions. [2025-04-26 16:14:09,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4792 states and 16664 transitions. [2025-04-26 16:14:09,118 INFO L131 ngComponentsAnalysis]: Automaton has 479 accepting balls. 3975 [2025-04-26 16:14:09,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4792 states to 4779 states and 16651 transitions. [2025-04-26 16:14:09,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4767 [2025-04-26 16:14:09,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4767 [2025-04-26 16:14:09,170 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4779 states and 16651 transitions. [2025-04-26 16:14:09,176 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:14:09,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4779 states and 16651 transitions. [2025-04-26 16:14:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states and 16651 transitions. [2025-04-26 16:14:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 4774. [2025-04-26 16:14:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4774 states, 4774 states have (on average 3.4868035190615836) internal successors, (in total 16646), 4773 states have internal predecessors, (16646), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 16646 transitions. [2025-04-26 16:14:09,285 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4774 states and 16646 transitions. [2025-04-26 16:14:09,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-26 16:14:09,286 INFO L438 stractBuchiCegarLoop]: Abstraction has 4774 states and 16646 transitions. [2025-04-26 16:14:09,286 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:14:09,286 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4774 states and 16646 transitions. [2025-04-26 16:14:09,307 INFO L131 ngComponentsAnalysis]: Automaton has 479 accepting balls. 3975 [2025-04-26 16:14:09,307 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:14:09,307 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:14:09,309 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:14:09,309 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:14:09,311 INFO L752 eck$LassoCheckResult]: Stem: "[269] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[279] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[332] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[360] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[290] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[323] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[304] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[266] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[280] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[292] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[358] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[359] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[373] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[375] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[328] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[249] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[377] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[276] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[294] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[244] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[242] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[315] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[381] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[295] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[248] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[245] L87-2-->L105: Formula: true InVars {} 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~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, 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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[253] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |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_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[361] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[352] L106-1-->L36: 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]" "[370] L36-->L37: 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]" "[298] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[357] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[293] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[371] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[366] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[344] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[273] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[313] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[367] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} 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_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#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]" "[372] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[311] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[257] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[255] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[354] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[333] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[282] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[319] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[263] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[256] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, 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_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[259] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[353] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[356] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[258] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[274] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[305] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[254] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[312] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, 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]" "[291] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[265] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) 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_12|, 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]" "[310] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[287] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[322] L89-2-->L92: Formula: true InVars {} OutVars{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]" "[350] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[338] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[302] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[423] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[382] $Ultimate##0-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_1| v_thread1Thread1of1ForFork2_~_argptr.offset_1) (= v_thread1Thread1of1ForFork2_~_argptr.base_1 |v_thread1Thread1of1ForFork2_#in~_argptr.base_1|)) InVars {thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} OutVars{thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_1, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_1|, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_1, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_~_argptr.offset]" "[383] L46-->L46-4: Formula: (= v_thread1Thread1of1ForFork2_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" [2025-04-26 16:14:09,311 INFO L754 eck$LassoCheckResult]: Loop: "[385] L46-4-->L47: Formula: (< v_thread1Thread1of1ForFork2_~i~0_5 v_~N~0_1) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} OutVars{thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_5, ~N~0=v_~N~0_1} AuxVars[] AssignedVars[]" "[387] L47-->L51: Formula: (let ((.cse5 (* v_thread1Thread1of1ForFork2_~i~0_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_41))) (let ((.cse0 (<= 0 .cse4)) (.cse1 (<= (+ .cse5 v_~A~0.offset_41 4) (select |v_#length_44| v_~A~0.base_41))) (.cse3 (= (select |v_#valid_45| v_~A~0.base_41) 1))) (and .cse0 .cse1 (let ((.cse2 (select (select |v_#memory_int_43| v_~A~0.base_41) .cse4))) (or (and (<= .cse2 v_~max1~0_25) (= v_~max1~0_25 v_~max1~0_24) (= |v_thread1Thread1of1ForFork2_#t~mem2_2| |v_thread1Thread1of1ForFork2_#t~mem2_1|)) (and (= v_~max1~0_24 .cse2) .cse0 .cse1 (< v_~max1~0_25 .cse2) .cse3))) .cse3)))) InVars {~max1~0=v_~max1~0_25, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} OutVars{~max1~0=v_~max1~0_24, ~A~0.base=v_~A~0.base_41, ~A~0.offset=v_~A~0.offset_41, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_1|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_2|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_9, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_43|, #length=|v_#length_44|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2]" "[389] L51-->L46-2: Formula: (= |v_thread1Thread1of1ForFork2_#t~post3_1| v_thread1Thread1of1ForFork2_~i~0_11) InVars {thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_1|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" "[391] L46-2-->L46-3: Formula: (= (+ |v_thread1Thread1of1ForFork2_#t~post3_3| 1) v_thread1Thread1of1ForFork2_~i~0_13) InVars {thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_3|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~i~0]" "[392] L46-3-->L46-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post3]" [2025-04-26 16:14:09,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash 537360624, now seen corresponding path program 1 times [2025-04-26 16:14:09,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:09,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566249774] [2025-04-26 16:14:09,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:09,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:14:09,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:14:09,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:09,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:09,328 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:09,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:14:09,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:14:09,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:09,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:09,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:09,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash 396100195, now seen corresponding path program 2 times [2025-04-26 16:14:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:09,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657591030] [2025-04-26 16:14:09,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:14:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:09,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:09,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:09,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:14:09,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:09,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:09,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:09,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:09,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:09,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:09,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:09,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1096140500, now seen corresponding path program 1 times [2025-04-26 16:14:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:09,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261244724] [2025-04-26 16:14:09,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:09,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-26 16:14:09,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-26 16:14:09,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:09,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:09,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:09,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-04-26 16:14:09,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-04-26 16:14:09,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:09,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:09,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:10,103 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:14:10,103 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:14:10,103 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:14:10,103 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:14:10,103 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:14:10,103 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:10,103 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:14:10,103 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:14:10,103 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array-hom.wvr.c_petrified1_Iteration3_Lasso [2025-04-26 16:14:10,103 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:14:10,103 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:14:10,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,391 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,397 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:10,840 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:14:10,840 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:14:10,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:10,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:10,842 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:10,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:14:10,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:10,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:10,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:10,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:10,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:10,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:10,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:10,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:10,856 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:10,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:10,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:10,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:10,863 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:10,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:14:10,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:10,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:10,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:10,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:10,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:10,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:10,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:10,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:10,876 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:10,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:14:10,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:10,883 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:10,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:14:10,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:10,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:10,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:10,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:10,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:10,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:10,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:10,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:10,895 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:10,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:14:10,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:10,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:10,902 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:10,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:14:10,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:10,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:10,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:10,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:10,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:10,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:10,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:10,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:10,916 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:10,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:10,923 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:10,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:14:10,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:10,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:10,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:10,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:10,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:10,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:10,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:10,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:10,935 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:10,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:14:10,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:10,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:10,943 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:10,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:14:10,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:10,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:10,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:10,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:10,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:10,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:10,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:10,960 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:10,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:14:10,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:10,967 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:10,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:14:10,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:10,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:10,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:10,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:10,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:10,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:10,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:10,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:10,980 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:10,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:14:10,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:10,987 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:10,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:14:10,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:10,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:10,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:10,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:10,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,003 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:14:11,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,011 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:14:11,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,025 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,028 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:11,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,036 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:14:11,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:11,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,061 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:14:11,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,084 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,093 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:14:11,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,112 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:14:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,120 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:14:11,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,138 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:11,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,147 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:14:11,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,164 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:11,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,173 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:14:11,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,186 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:14:11,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,188 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:14:11,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,193 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:11,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,200 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:14: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 [2025-04-26 16:14:11,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,215 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:11,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,223 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:14:11,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,238 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:14:11,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,245 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:14:11,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,257 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:14:11,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,262 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:14:11,262 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:14:11,274 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:11,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:11,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,281 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:14:11,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:11,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:11,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:11,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:11,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:11,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:11,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:11,306 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:14:11,333 INFO L436 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2025-04-26 16:14:11,333 INFO L437 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-04-26 16:14:11,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:11,335 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:11,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:14:11,337 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:14:11,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:14:11,352 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:14:11,352 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:14:11,353 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_1, thread1Thread1of1ForFork2_~i~0) = 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_1 - 4*thread1Thread1of1ForFork2_~i~0 Supporting invariants [1*~A~0.offset >= 0] [2025-04-26 16:14:11,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:14:11,380 INFO L156 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2025-04-26 16:14:11,384 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:14:11,384 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:14:11,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:11,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-26 16:14:11,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-26 16:14:11,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:11,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:11,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:14:11,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:14:11,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:11,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:11,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:11,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:11,658 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:14:11,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:14:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:14:11,737 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2025-04-26 16:14:11,737 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4774 states and 16646 transitions. cyclomatic complexity: 12352 Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (in total 75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:12,089 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4774 states and 16646 transitions. cyclomatic complexity: 12352. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (in total 75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9893 states and 38583 transitions. Complement of second has 17 states. [2025-04-26 16:14:12,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 9 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:14:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (in total 75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 259 transitions. [2025-04-26 16:14:12,091 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 259 transitions. Stem has 70 letters. Loop has 5 letters. [2025-04-26 16:14:12,091 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:12,091 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 259 transitions. Stem has 75 letters. Loop has 5 letters. [2025-04-26 16:14:12,091 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:12,091 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 259 transitions. Stem has 70 letters. Loop has 10 letters. [2025-04-26 16:14:12,092 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:12,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9893 states and 38583 transitions. [2025-04-26 16:14:12,167 INFO L131 ngComponentsAnalysis]: Automaton has 509 accepting balls. 3225 [2025-04-26 16:14:12,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9893 states to 8690 states and 33535 transitions. [2025-04-26 16:14:12,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4815 [2025-04-26 16:14:12,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6362 [2025-04-26 16:14:12,299 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8690 states and 33535 transitions. [2025-04-26 16:14:12,299 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:14:12,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8690 states and 33535 transitions. [2025-04-26 16:14:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8690 states and 33535 transitions. [2025-04-26 16:14:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8690 to 7145. [2025-04-26 16:14:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7145 states, 7145 states have (on average 3.876137158852344) internal successors, (in total 27695), 7144 states have internal predecessors, (27695), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 27695 transitions. [2025-04-26 16:14:12,479 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7145 states and 27695 transitions. [2025-04-26 16:14:12,479 INFO L438 stractBuchiCegarLoop]: Abstraction has 7145 states and 27695 transitions. [2025-04-26 16:14:12,479 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:14:12,479 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7145 states and 27695 transitions. [2025-04-26 16:14:12,517 INFO L131 ngComponentsAnalysis]: Automaton has 509 accepting balls. 3225 [2025-04-26 16:14:12,517 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:14:12,517 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:14:12,518 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:14:12,518 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:14:12,520 INFO L752 eck$LassoCheckResult]: Stem: "[269] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[279] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[332] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[360] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[290] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[323] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[304] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[266] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[280] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[292] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[358] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[359] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[373] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[375] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[328] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[249] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[377] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[276] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[294] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[244] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[242] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[315] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[381] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[295] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[248] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[245] L87-2-->L105: Formula: true InVars {} 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~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, 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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[253] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |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_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[361] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[352] L106-1-->L36: 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]" "[370] L36-->L37: 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]" "[298] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[357] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[293] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[371] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[366] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[344] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[273] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[313] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[367] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} 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_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#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]" "[372] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[311] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[257] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[255] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[354] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[333] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[282] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[319] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[263] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[256] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, 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_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[259] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[353] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[356] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[258] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[274] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[305] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[254] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[312] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, 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]" "[291] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[265] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) 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_12|, 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]" "[310] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[287] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[322] L89-2-->L92: Formula: true InVars {} OutVars{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]" "[350] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[338] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[302] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[423] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[320] L92-4-->L92-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-5-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1]" "[275] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[355] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[335] L93-2-->L93-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre15#1_3|) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[417] L93-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_8|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_4|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[393] $Ultimate##0-->L58: Formula: (and (= v_thread2Thread1of1ForFork0_~_argptr.offset_1 |v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|) (= v_thread2Thread1of1ForFork0_~_argptr.base_1 |v_thread2Thread1of1ForFork0_#in~_argptr.base_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_1, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset]" "[394] L58-->L58-4: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" [2025-04-26 16:14:12,520 INFO L754 eck$LassoCheckResult]: Loop: "[396] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork0_~i~1_5 v_~M~0_1) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[]" "[398] L59-->L63: Formula: (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_37))) (let ((.cse0 (= (select |v_#valid_41| v_~A~0.base_37) 1)) (.cse2 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_37 4) (select |v_#length_40| v_~A~0.base_37)))) (and .cse0 (let ((.cse1 (select (select |v_#memory_int_39| v_~A~0.base_37) .cse4))) (or (and (= v_~max2~0_25 v_~max2~0_24) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse1 v_~max2~0_25)) (and (= v_~max2~0_24 .cse1) .cse0 .cse2 .cse3 (< v_~max2~0_25 .cse1)))) .cse2 .cse3)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_25, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_24, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[400] L63-->L58-2: Formula: (= |v_thread2Thread1of1ForFork0_#t~post6_1| v_thread2Thread1of1ForFork0_~i~1_11) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" "[402] L58-2-->L58-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post6_3| 1) v_thread2Thread1of1ForFork0_~i~1_13) InVars {thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_13, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" "[403] L58-3-->L58-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" [2025-04-26 16:14:12,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -482823936, now seen corresponding path program 1 times [2025-04-26 16:14:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:12,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662318502] [2025-04-26 16:14:12,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:12,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-26 16:14:12,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-26 16:14:12,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:12,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:12,531 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:12,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-04-26 16:14:12,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-04-26 16:14:12,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:12,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:12,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:12,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:12,551 INFO L85 PathProgramCache]: Analyzing trace with hash 406597550, now seen corresponding path program 1 times [2025-04-26 16:14:12,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:12,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650905522] [2025-04-26 16:14:12,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:12,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:12,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:12,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:12,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:12,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:12,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:12,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:12,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:12,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:12,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:12,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:12,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:12,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2146089457, now seen corresponding path program 1 times [2025-04-26 16:14:12,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:12,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891863878] [2025-04-26 16:14:12,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:12,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:12,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-26 16:14:12,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-26 16:14:12,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:12,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:14:12,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:14:12,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891863878] [2025-04-26 16:14:12,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891863878] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:14:12,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139746913] [2025-04-26 16:14:12,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:12,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:14:12,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:12,856 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:14:12,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-26 16:14:12,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-26 16:14:12,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-26 16:14:12,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:12,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:12,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:14:12,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:14:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:14:13,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:14:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:14:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139746913] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:14:13,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:14:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2025-04-26 16:14:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622772970] [2025-04-26 16:14:13,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:14:13,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:14:13,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-26 16:14:13,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2025-04-26 16:14:13,413 INFO L87 Difference]: Start difference. First operand 7145 states and 27695 transitions. cyclomatic complexity: 21207 Second operand has 28 states, 28 states have (on average 5.928571428571429) internal successors, (in total 166), 28 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:14:14,090 INFO L93 Difference]: Finished difference Result 11399 states and 43308 transitions. [2025-04-26 16:14:14,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11399 states and 43308 transitions. [2025-04-26 16:14:14,177 INFO L131 ngComponentsAnalysis]: Automaton has 748 accepting balls. 4420 [2025-04-26 16:14:14,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11399 states to 10739 states and 40876 transitions. [2025-04-26 16:14:14,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7230 [2025-04-26 16:14:14,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7230 [2025-04-26 16:14:14,272 INFO L74 IsDeterministic]: Start isDeterministic. Operand 10739 states and 40876 transitions. [2025-04-26 16:14:14,272 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:14:14,272 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10739 states and 40876 transitions. [2025-04-26 16:14:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10739 states and 40876 transitions. [2025-04-26 16:14:14,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10739 to 8754. [2025-04-26 16:14:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8754 states, 8754 states have (on average 3.85183915924149) internal successors, (in total 33719), 8753 states have internal predecessors, (33719), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:14,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8754 states to 8754 states and 33719 transitions. [2025-04-26 16:14:14,535 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8754 states and 33719 transitions. [2025-04-26 16:14:14,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-26 16:14:14,536 INFO L438 stractBuchiCegarLoop]: Abstraction has 8754 states and 33719 transitions. [2025-04-26 16:14:14,536 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:14:14,536 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8754 states and 33719 transitions. [2025-04-26 16:14:14,580 INFO L131 ngComponentsAnalysis]: Automaton has 611 accepting balls. 3735 [2025-04-26 16:14:14,581 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:14:14,581 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:14:14,581 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:14:14,581 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:14:14,582 INFO L752 eck$LassoCheckResult]: Stem: "[269] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[279] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[332] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[360] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[290] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[323] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[304] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[266] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[280] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[292] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[358] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[359] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[373] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[375] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[328] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[249] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[377] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[276] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[294] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[244] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[242] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[315] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[381] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[295] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[248] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[245] L87-2-->L105: Formula: true InVars {} 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~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, 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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[253] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |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_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[361] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[352] L106-1-->L36: 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]" "[370] L36-->L37: 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]" "[298] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[357] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[293] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[371] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[366] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[344] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[273] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[313] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[367] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} 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_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#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]" "[372] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[311] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[257] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[255] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[354] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[333] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[282] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[319] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[263] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[256] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, 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_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[259] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[353] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[356] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[258] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[274] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[305] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[254] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[312] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, 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]" "[291] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[265] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) 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_12|, 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]" "[310] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[287] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[322] L89-2-->L92: Formula: true InVars {} OutVars{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]" "[350] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[338] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[302] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[423] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[320] L92-4-->L92-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-5-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1]" "[275] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[355] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[335] L93-2-->L93-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre15#1_3|) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[417] L93-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_8|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_4|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[364] L93-4-->L93-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[260] L93-5-->L94: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1]" "[362] L94-->L94-1: Formula: (= |v_ULTIMATE.start_main_#t~pre17#1_2| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{#pthreadsForks=|v_#pthreadsForks_7|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre17#1]" "[316] L94-1-->L94-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks]" "[339] L94-2-->L94-3: Formula: (= |v_ULTIMATE.start_main_~t3~0#1_3| |v_ULTIMATE.start_main_#t~pre17#1_3|) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_3|} OutVars{ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_3|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[420] L94-3-->$Ultimate##0: Formula: (and (= |v_thread3Thread1of1ForFork1_#in~_argptr.base_4| 0) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_7|) (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= |v_thread3Thread1of1ForFork1_#in~_argptr.offset_4| 0) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_7|} OutVars{thread3Thread1of1ForFork1_#in~_argptr.base=|v_thread3Thread1of1ForFork1_#in~_argptr.base_4|, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_4|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_16, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_~_argptr.base=v_thread3Thread1of1ForFork1_~_argptr.base_4, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_7|, thread3Thread1of1ForFork1_#t~mem7=|v_thread3Thread1of1ForFork1_#t~mem7_4|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2, thread3Thread1of1ForFork1_~_argptr.offset=v_thread3Thread1of1ForFork1_~_argptr.offset_4, thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_8|, thread3Thread1of1ForFork1_#in~_argptr.offset=|v_thread3Thread1of1ForFork1_#in~_argptr.offset_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#in~_argptr.base, thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_~i~2, thread3Thread1of1ForFork1_#t~mem8, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_~_argptr.base, thread3Thread1of1ForFork1_#t~mem7, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2, thread3Thread1of1ForFork1_~_argptr.offset, thread3Thread1of1ForFork1_#t~post9, thread3Thread1of1ForFork1_#in~_argptr.offset]" "[404] $Ultimate##0-->L70: Formula: (and (= v_thread3Thread1of1ForFork1_~_argptr.offset_1 |v_thread3Thread1of1ForFork1_#in~_argptr.offset_1|) (= |v_thread3Thread1of1ForFork1_#in~_argptr.base_1| v_thread3Thread1of1ForFork1_~_argptr.base_1)) InVars {thread3Thread1of1ForFork1_#in~_argptr.base=|v_thread3Thread1of1ForFork1_#in~_argptr.base_1|, thread3Thread1of1ForFork1_#in~_argptr.offset=|v_thread3Thread1of1ForFork1_#in~_argptr.offset_1|} OutVars{thread3Thread1of1ForFork1_~_argptr.offset=v_thread3Thread1of1ForFork1_~_argptr.offset_1, thread3Thread1of1ForFork1_#in~_argptr.base=|v_thread3Thread1of1ForFork1_#in~_argptr.base_1|, thread3Thread1of1ForFork1_#in~_argptr.offset=|v_thread3Thread1of1ForFork1_#in~_argptr.offset_1|, thread3Thread1of1ForFork1_~_argptr.base=v_thread3Thread1of1ForFork1_~_argptr.base_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~_argptr.offset, thread3Thread1of1ForFork1_~_argptr.base]" "[405] L70-->L70-4: Formula: (= v_thread3Thread1of1ForFork1_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2]" [2025-04-26 16:14:14,583 INFO L754 eck$LassoCheckResult]: Loop: "[407] L70-4-->L71: Formula: (< v_thread3Thread1of1ForFork1_~i~2_5 v_~N~0_4) InVars {thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_5, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_5, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[]" "[409] L71-->L75: Formula: (let ((.cse5 (* v_thread3Thread1of1ForFork1_~i~2_9 4))) (let ((.cse4 (+ v_~A~0.offset_45 .cse5))) (let ((.cse1 (<= 0 .cse4)) (.cse2 (<= (+ v_~A~0.offset_45 4 .cse5) (select |v_#length_48| v_~A~0.base_45))) (.cse3 (= (select |v_#valid_49| v_~A~0.base_45) 1))) (and (let ((.cse0 (select (select |v_#memory_int_47| v_~A~0.base_45) .cse4))) (or (and (<= .cse0 v_~max3~0_21) (= |v_thread3Thread1of1ForFork1_#t~mem8_2| |v_thread3Thread1of1ForFork1_#t~mem8_1|) (= v_~max3~0_21 v_~max3~0_20)) (and (= v_~max3~0_20 .cse0) (< v_~max3~0_21 .cse0) .cse1 .cse2 .cse3))) .cse1 .cse2 .cse3)))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~max3~0=v_~max3~0_21, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_47|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_1|, #length=|v_#length_48|} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, ~max3~0=v_~max3~0_20, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_47|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, thread3Thread1of1ForFork1_#t~mem8=|v_thread3Thread1of1ForFork1_#t~mem8_2|, #length=|v_#length_48|, thread3Thread1of1ForFork1_#t~mem7=|v_thread3Thread1of1ForFork1_#t~mem7_1|} AuxVars[] AssignedVars[~max3~0, thread3Thread1of1ForFork1_#t~mem8, thread3Thread1of1ForFork1_#t~mem7]" "[411] L75-->L70-2: Formula: (= v_thread3Thread1of1ForFork1_~i~2_11 |v_thread3Thread1of1ForFork1_#t~post9_1|) InVars {thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_11} OutVars{thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_1|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_11} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9]" "[413] L70-2-->L70-3: Formula: (= v_thread3Thread1of1ForFork1_~i~2_13 (+ |v_thread3Thread1of1ForFork1_#t~post9_3| 1)) InVars {thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_3|} OutVars{thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_3|, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_13} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~i~2]" "[414] L70-3-->L70-4: Formula: true InVars {} OutVars{thread3Thread1of1ForFork1_#t~post9=|v_thread3Thread1of1ForFork1_#t~post9_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9]" [2025-04-26 16:14:14,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:14,583 INFO L85 PathProgramCache]: Analyzing trace with hash -823484229, now seen corresponding path program 1 times [2025-04-26 16:14:14,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:14,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547318293] [2025-04-26 16:14:14,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:14,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:14,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-26 16:14:14,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-26 16:14:14,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:14,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:14,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:14,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-26 16:14:14,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-26 16:14:14,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:14,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:14,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:14,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:14,624 INFO L85 PathProgramCache]: Analyzing trace with hash 417094905, now seen corresponding path program 1 times [2025-04-26 16:14:14,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:14,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494777830] [2025-04-26 16:14:14,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:14,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:14,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:14,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:14,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:14,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:14,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:14,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:14,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:14,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:14,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:14,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:14,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1358635135, now seen corresponding path program 1 times [2025-04-26 16:14:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:14,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008248023] [2025-04-26 16:14:14,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:14:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:14,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-26 16:14:14,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-26 16:14:14,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:14,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:14,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:14,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-26 16:14:14,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-26 16:14:14,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:14,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:14,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:15,576 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:14:15,576 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:14:15,576 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:14:15,576 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:14:15,576 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:14:15,576 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:15,576 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:14:15,576 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:14:15,576 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array-hom.wvr.c_petrified1_Iteration5_Lasso [2025-04-26 16:14:15,576 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:14:15,576 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:14:15,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,826 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:15,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:16,263 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:14:16,263 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:14:16,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,265 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:14:16,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,280 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:14:16,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,287 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:14:16,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,299 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:14:16,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,306 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:14:16,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,321 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:16,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,329 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:14:16,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,345 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:16,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,352 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:14:16,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,366 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:14:16,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,375 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:14:16,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,388 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:16,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,395 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:14:16,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,410 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:14:16,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,417 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:14:16,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,429 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:14:16,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,436 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:14:16,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,449 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:16,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,456 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:14:16,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,469 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:14:16,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,476 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:14:16,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,491 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:14:16,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,502 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:14:16,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,518 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:14:16,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,525 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:14:16,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,538 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:14:16,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,547 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:14:16,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,561 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 16:14:16,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,568 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:14:16,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,580 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:14:16,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,588 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:14:16,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,602 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 16:14:16,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,609 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:14:16,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:16,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:16,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:16,621 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:14:16,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,628 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:14:16,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,642 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 16:14:16,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,667 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:14:16,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,678 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:14:16,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,680 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:14:16,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,684 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:16,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,691 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:14:16,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,702 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:14:16,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,707 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:14:16,707 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:14:16,716 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:14:16,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,723 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:14:16,725 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,738 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:14:16,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,744 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:14:16,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,758 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:14:16,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,765 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:14:16,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,780 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:16,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,787 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:14:16,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,799 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,802 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:14:16,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,809 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:14:16,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,824 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:16,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:14:16,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,831 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:14:16,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:16,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:16,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:16,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:16,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:16,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:16,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:16,852 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:14:16,863 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:14:16,863 INFO L437 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:14:16,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:16,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:16,865 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:16,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:14:16,866 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:14:16,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 16:14:16,881 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:14:16,881 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:14:16,881 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread3Thread1of1ForFork1_~i~2) = 1*~N~0 - 1*thread3Thread1of1ForFork1_~i~2 Supporting invariants [] [2025-04-26 16:14:16,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 16:14:16,900 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-04-26 16:14:16,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:16,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-26 16:14:16,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-26 16:14:16,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:16,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:16,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:14:16,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:14:16,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:16,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:16,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:16,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:16,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:14:16,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:14:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:14:17,024 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:14:17,024 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8754 states and 33719 transitions. cyclomatic complexity: 25775 Second operand has 5 states, 5 states have (on average 17.4) internal successors, (in total 87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:17,242 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8754 states and 33719 transitions. cyclomatic complexity: 25775. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (in total 87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 18653 states and 79044 transitions. Complement of second has 9 states. [2025-04-26 16:14:17,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:14:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 17.4) internal successors, (in total 87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2025-04-26 16:14:17,243 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 221 transitions. Stem has 82 letters. Loop has 5 letters. [2025-04-26 16:14:17,243 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:17,243 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 221 transitions. Stem has 87 letters. Loop has 5 letters. [2025-04-26 16:14:17,244 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:17,244 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 221 transitions. Stem has 82 letters. Loop has 10 letters. [2025-04-26 16:14:17,244 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:17,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18653 states and 79044 transitions. [2025-04-26 16:14:17,452 INFO L131 ngComponentsAnalysis]: Automaton has 440 accepting balls. 2200 [2025-04-26 16:14:17,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18653 states to 9959 states and 42132 transitions. [2025-04-26 16:14:17,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3948 [2025-04-26 16:14:17,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4898 [2025-04-26 16:14:17,541 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9959 states and 42132 transitions. [2025-04-26 16:14:17,541 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:14:17,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9959 states and 42132 transitions. [2025-04-26 16:14:17,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9959 states and 42132 transitions. [2025-04-26 16:14:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9959 to 8783. [2025-04-26 16:14:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8783 states, 8783 states have (on average 4.270294887851532) internal successors, (in total 37506), 8782 states have internal predecessors, (37506), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8783 states to 8783 states and 37506 transitions. [2025-04-26 16:14:17,717 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8783 states and 37506 transitions. [2025-04-26 16:14:17,717 INFO L438 stractBuchiCegarLoop]: Abstraction has 8783 states and 37506 transitions. [2025-04-26 16:14:17,717 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:14:17,717 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8783 states and 37506 transitions. [2025-04-26 16:14:17,757 INFO L131 ngComponentsAnalysis]: Automaton has 440 accepting balls. 2200 [2025-04-26 16:14:17,757 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:14:17,757 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:14:17,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:14:17,758 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:14:17,759 INFO L752 eck$LassoCheckResult]: Stem: "[269] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_7| 0) 0) InVars {#valid=|v_#valid_7|} OutVars{#valid=|v_#valid_7|} AuxVars[] AssignedVars[]" "[279] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[332] L21-->L21-1: Formula: (and (= (select |v_#valid_8| 1) 1) (= 2 (select |v_#length_7| 1))) InVars {#length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#length=|v_#length_7|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[]" "[360] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[]" "[290] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[]" "[323] L21-3-->L21-4: Formula: (and (= (select |v_#valid_9| 2) 1) (= 32 (select |v_#length_8| 2))) InVars {#length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{#length=|v_#length_8|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[]" "[304] L21-4-->L41: Formula: (and (= v_~A~0.base_7 0) (= v_~A~0.offset_7 0)) InVars {} OutVars{~A~0.base=v_~A~0.base_7, ~A~0.offset=v_~A~0.offset_7} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[266] L41-->L41-1: Formula: (= v_~max1~0_4 0) InVars {} OutVars{~max1~0=v_~max1~0_4} AuxVars[] AssignedVars[~max1~0]" "[280] L41-1-->L41-2: Formula: (= v_~max2~0_4 0) InVars {} OutVars{~max2~0=v_~max2~0_4} AuxVars[] AssignedVars[~max2~0]" "[292] L41-2-->L41-3: Formula: (= v_~max3~0_4 0) InVars {} OutVars{~max3~0=v_~max3~0_4} AuxVars[] AssignedVars[~max3~0]" "[358] L41-3-->L41-4: Formula: (= v_~M~0_4 0) InVars {} OutVars{~M~0=v_~M~0_4} AuxVars[] AssignedVars[~M~0]" "[359] L41-4-->L-1-1: Formula: (= v_~N~0_5 0) InVars {} OutVars{~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0]" "[373] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[375] L-1-2-->L82: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_1|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_~t3~0#1, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base, ULTIMATE.start_main_~t2~0#1]" "[328] L82-->L82-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[249] L82-1-->L82-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[377] L82-2-->L85: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t3~0#1]" "[276] L85-->L85-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[294] L85-1-->L85-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} AuxVars[] AssignedVars[~M~0]" "[244] L85-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[242] L86-->L86-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[315] L86-1-->L86-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~N~0_6) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0]" "[381] L86-2-->L87: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1]" "[295] L87-->L87-1: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1| v_~N~0_7) InVars {~N~0=v_~N~0_7} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_1|, ~N~0=v_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[248] L87-1-->L87-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_1|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[245] L87-2-->L105: Formula: true InVars {} 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~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_1|, 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~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_1|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_1|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_1|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_1|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[253] L105-->L106: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~size#1_2| |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_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~size#1]" "[361] L106-->L106-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_3|) 1 0)) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_3|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[352] L106-1-->L36: 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]" "[370] L36-->L37: 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]" "[298] L37-->L36-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[]" "[357] L36-1-->L106-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[293] L106-2-->L107: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[371] L107-->L107-1: Formula: (= (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_4| 4294967296) 1073741823) 1 0) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|) InVars {ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_4|, 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]" "[366] L107-1-->L36-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[344] L36-2-->L37-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_7|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[273] L37-3-->L36-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[]" "[313] L36-3-->L107-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_10|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[307] L107-2-->L109: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1]" "[348] L109-->L109-1: Formula: (and (= |v_#valid_10| (store |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 1)) (not (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| 0)) (= (store |v_#length_10| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| (* 4 (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_5| 1073741824))) |v_#length_9|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2| 0) (= (select |v_#valid_11| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|) 0) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2| |v_#StackHeapBarrier_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_10|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_2|, #length=|v_#length_9|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_5|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, #valid, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, #length]" "[367] L109-1-->L109-2: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|)) InVars {ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|} 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_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#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]" "[372] L109-2-->L110: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_4|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base]" "[311] L110-->L110-5: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2| 0) InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[257] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[255] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[354] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[333] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[282] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[319] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[263] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[257] L110-5-->L111: Formula: (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3| |v_ULTIMATE.start_create_fresh_int_array_~size#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_3|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_6|} AuxVars[] AssignedVars[]" "[255] L111-->L111-1: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[354] L111-1-->L111-2: Formula: (let ((.cse1 (* 4 |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| .cse1))) (and (<= 0 .cse0) (= (store |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3| (store (select |v_#memory_int_10| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|)) |v_#memory_int_9|) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3| 4 .cse1) (select |v_#length_11| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|) 1)))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_3|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_3|, #length=|v_#length_11|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_4|} AuxVars[] AssignedVars[#memory_int]" "[333] L111-2-->L110-2: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet20#1]" "[282] L110-2-->L110-3: Formula: (= |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_5|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[319] L110-3-->L110-4: Formula: (= (+ |v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|) InVars {ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_6|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[263] L110-4-->L110-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~post21#1]" "[256] L110-5-->L110-6: Formula: (<= |v_ULTIMATE.start_create_fresh_int_array_~size#1_7| |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|) InVars {ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, 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_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_7|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_7|} AuxVars[] AssignedVars[]" "[259] L110-6-->L113: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~i~3#1]" "[353] L113-->create_fresh_int_array_returnLabel#1: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|)) InVars {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_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_4|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_2|, 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_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base]" "[356] create_fresh_int_array_returnLabel#1-->L87-3: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|) (= |v_ULTIMATE.start_main_#t~ret12#1.base_2| |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|)) InVars {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|} OutVars{ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_3|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_3|, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_2|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[258] L87-3-->L87-4: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset_5|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_5|, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_5|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_9|, ULTIMATE.start_create_fresh_int_array_#t~post21#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post21#1_5|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_8|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base, ULTIMATE.start_create_fresh_int_array_#t~nondet20#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post21#1, ULTIMATE.start_create_fresh_int_array_~size#1]" "[274] L87-4-->L87-5: Formula: true InVars {} OutVars{ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#in~size#1]" "[305] L87-5-->L87-6: Formula: (and (= |v_ULTIMATE.start_main_#t~ret12#1.offset_3| v_~A~0.offset_8) (= v_~A~0.base_8 |v_ULTIMATE.start_main_#t~ret12#1.base_3|)) InVars {ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} OutVars{~A~0.base=v_~A~0.base_8, ~A~0.offset=v_~A~0.offset_8, ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_3|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_3|} AuxVars[] AssignedVars[~A~0.base, ~A~0.offset]" "[254] L87-6-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~ret12#1.offset=|v_ULTIMATE.start_main_#t~ret12#1.offset_4|, ULTIMATE.start_main_#t~ret12#1.base=|v_ULTIMATE.start_main_#t~ret12#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret12#1.offset, ULTIMATE.start_main_#t~ret12#1.base]" "[312] L89-->L89-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_7| (ite (and (< v_~M~0_6 v_~N~0_8) (<= 0 v_~M~0_6)) 1 0)) InVars {~M~0=v_~M~0_6, ~N~0=v_~N~0_8} OutVars{~M~0=v_~M~0_6, ~N~0=v_~N~0_8, 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]" "[291] L89-1-->L36-4: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[265] L36-4-->L37-6: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_12|) 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_12|, 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]" "[310] L37-6-->L36-5: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_14| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_14|} AuxVars[] AssignedVars[]" "[287] L36-5-->L89-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1]" "[322] L89-2-->L92: Formula: true InVars {} OutVars{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]" "[350] L92-->L92-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[338] L92-1-->L92-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[302] L92-2-->L92-3: Formula: (= |v_ULTIMATE.start_main_~t1~0#1_3| |v_ULTIMATE.start_main_#t~pre13#1_3|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[423] L92-3-->$Ultimate##0: Formula: (and (= |v_thread1Thread1of1ForFork2_#in~_argptr.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre13#1_7| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2) (= |v_thread1Thread1of1ForFork2_#in~_argptr.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork2_~i~0=v_thread1Thread1of1ForFork2_~i~0_16, thread1Thread1of1ForFork2_#t~post3=|v_thread1Thread1of1ForFork2_#t~post3_8|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_4|, thread1Thread1of1ForFork2_#in~_argptr.offset=|v_thread1Thread1of1ForFork2_#in~_argptr.offset_4|, thread1Thread1of1ForFork2_#t~mem1=|v_thread1Thread1of1ForFork2_#t~mem1_4|, thread1Thread1of1ForFork2_#t~mem2=|v_thread1Thread1of1ForFork2_#t~mem2_6|, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_4, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_4, thread1Thread1of1ForFork2_#in~_argptr.base=|v_thread1Thread1of1ForFork2_#in~_argptr.base_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#t~mem1, thread1Thread1of1ForFork2_#t~mem2, thread1Thread1of1ForFork2_~i~0, thread1Thread1of1ForFork2_#t~post3, thread1Thread1of1ForFork2_~_argptr.base, thread1Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork2_#in~_argptr.offset, thread1Thread1of1ForFork2_~_argptr.offset, thread1Thread1of1ForFork2_#in~_argptr.base]" "[320] L92-4-->L92-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1]" "[334] L92-5-->L93: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1]" "[275] L93-->L93-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1]" "[355] L93-1-->L93-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[335] L93-2-->L93-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre15#1_3|) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[417] L93-3-->$Ultimate##0: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~_argptr.base_4| 0) (= |v_thread2Thread1of1ForFork0_#in~_argptr.offset_4| 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_4|, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_4, thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_4|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_4, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_16, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_8|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_4|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_6|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#in~_argptr.offset, thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_~i~1, thread2Thread1of1ForFork0_#t~post6, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[393] $Ultimate##0-->L58: Formula: (and (= v_thread2Thread1of1ForFork0_~_argptr.offset_1 |v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|) (= v_thread2Thread1of1ForFork0_~_argptr.base_1 |v_thread2Thread1of1ForFork0_#in~_argptr.base_1|)) InVars {thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|} OutVars{thread2Thread1of1ForFork0_#in~_argptr.base=|v_thread2Thread1of1ForFork0_#in~_argptr.base_1|, thread2Thread1of1ForFork0_#in~_argptr.offset=|v_thread2Thread1of1ForFork0_#in~_argptr.offset_1|, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_1, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~_argptr.base, thread2Thread1of1ForFork0_~_argptr.offset]" "[394] L58-->L58-4: Formula: (= v_thread2Thread1of1ForFork0_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" [2025-04-26 16:14:17,759 INFO L754 eck$LassoCheckResult]: Loop: "[396] L58-4-->L59: Formula: (< v_thread2Thread1of1ForFork0_~i~1_5 v_~M~0_1) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_5, ~M~0=v_~M~0_1} AuxVars[] AssignedVars[]" "[398] L59-->L63: Formula: (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_9 4))) (let ((.cse4 (+ .cse5 v_~A~0.offset_37))) (let ((.cse0 (= (select |v_#valid_41| v_~A~0.base_37) 1)) (.cse2 (<= 0 .cse4)) (.cse3 (<= (+ .cse5 v_~A~0.offset_37 4) (select |v_#length_40| v_~A~0.base_37)))) (and .cse0 (let ((.cse1 (select (select |v_#memory_int_39| v_~A~0.base_37) .cse4))) (or (and (= v_~max2~0_25 v_~max2~0_24) (= |v_thread2Thread1of1ForFork0_#t~mem5_2| |v_thread2Thread1of1ForFork0_#t~mem5_1|) (<= .cse1 v_~max2~0_25)) (and (= v_~max2~0_24 .cse1) .cse0 .cse2 .cse3 (< v_~max2~0_25 .cse1)))) .cse2 .cse3)))) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_25, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_1|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_9, ~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~max2~0=v_~max2~0_24, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_39|, #length=|v_#length_40|, thread2Thread1of1ForFork0_#t~mem4=|v_thread2Thread1of1ForFork0_#t~mem4_1|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_2|} AuxVars[] AssignedVars[~max2~0, thread2Thread1of1ForFork0_#t~mem4, thread2Thread1of1ForFork0_#t~mem5]" "[400] L63-->L58-2: Formula: (= |v_thread2Thread1of1ForFork0_#t~post6_1| v_thread2Thread1of1ForFork0_~i~1_11) InVars {thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" "[402] L58-2-->L58-3: Formula: (= (+ |v_thread2Thread1of1ForFork0_#t~post6_3| 1) v_thread2Thread1of1ForFork0_~i~1_13) InVars {thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} OutVars{thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_13, thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_3|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1]" "[403] L58-3-->L58-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~post6=|v_thread2Thread1of1ForFork0_#t~post6_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post6]" [2025-04-26 16:14:17,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1307615697, now seen corresponding path program 2 times [2025-04-26 16:14:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:17,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122888040] [2025-04-26 16:14:17,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:14:17,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:17,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 83 statements into 2 equivalence classes. [2025-04-26 16:14:17,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 16:14:17,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:14:17,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:17,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:17,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-26 16:14:17,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 16:14:17,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:17,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:17,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:17,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:17,793 INFO L85 PathProgramCache]: Analyzing trace with hash 406597550, now seen corresponding path program 2 times [2025-04-26 16:14:17,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:17,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704309557] [2025-04-26 16:14:17,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:14:17,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:17,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:17,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:17,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:14:17,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:17,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:17,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:17,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:17,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:17,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:17,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:17,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:17,799 INFO L85 PathProgramCache]: Analyzing trace with hash 527970270, now seen corresponding path program 2 times [2025-04-26 16:14:17,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:14:17,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574984846] [2025-04-26 16:14:17,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:14:17,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:14:17,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-04-26 16:14:17,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:14:17,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:14:17,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:17,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:14:17,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-26 16:14:17,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-26 16:14:17,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:17,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:14:17,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:14:18,639 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:14:18,639 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:14:18,639 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:14:18,639 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:14:18,639 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:14:18,639 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:18,639 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:14:18,639 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:14:18,639 INFO L132 ssoRankerPreferences]: Filename of dumped script: popl20-more-max-array-hom.wvr.c_petrified1_Iteration6_Lasso [2025-04-26 16:14:18,639 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:14:18,639 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:14:18,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:18,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:14:19,253 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:14:19,253 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:14:19,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,255 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:14:19,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,269 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 16:14:19,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,276 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:14:19,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,289 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 16:14:19,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,296 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:14:19,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,309 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 16:14:19,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,317 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:14:19,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,330 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-04-26 16:14:19,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,337 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 16:14:19,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,351 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:14:19,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,358 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 16:14:19,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,371 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 16:14:19,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,379 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 16:14:19,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,395 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:19,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,402 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 16:14:19,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,417 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-04-26 16:14:19,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,424 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 16:14:19,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,438 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 16:14:19,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,445 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 16:14:19,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,457 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,461 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-04-26 16:14:19,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,469 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 16:14:19,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,483 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-04-26 16:14:19,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,490 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 16:14:19,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,502 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-04-26 16:14:19,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,509 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 16:14:19,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,521 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-04-26 16:14:19,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,528 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 16:14:19,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,541 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-04-26 16:14:19,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,548 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 16:14:19,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,560 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-04-26 16:14:19,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,567 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 16:14:19,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,580 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:19,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,587 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-04-26 16:14:19,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,600 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-04-26 16:14:19,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,607 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-04-26 16:14:19,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,619 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-04-26 16:14:19,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,626 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-04-26 16:14:19,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,639 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-04-26 16:14:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,646 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-04-26 16:14:19,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,659 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-04-26 16:14:19,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,666 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-04-26 16:14:19,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,680 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-04-26 16:14:19,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,687 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-04-26 16:14:19,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,700 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-04-26 16:14:19,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,728 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-04-26 16:14:19,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,741 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-04-26 16:14:19,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,749 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-04-26 16:14:19,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,764 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-04-26 16:14:19,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,771 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-04-26 16:14:19,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,786 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-04-26 16:14:19,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,795 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-04-26 16:14:19,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,809 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-04-26 16:14:19,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,817 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-04-26 16:14:19,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,831 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-04-26 16:14:19,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,839 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-04-26 16:14:19,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,854 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-04-26 16:14:19,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,862 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-04-26 16:14:19,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,875 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:19,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,883 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-04-26 16:14:19,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,895 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:14:19,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,896 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:14:19,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,901 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-04-26 16:14:19,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,908 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-04-26 16:14:19,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,923 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-04-26 16:14:19,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,931 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-04-26 16:14:19,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:14:19,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:14:19,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:14:19,943 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-04-26 16:14:19,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,951 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-04-26 16:14:19,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,967 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-04-26 16:14:19,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,975 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-04-26 16:14:19,977 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:19,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:19,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:19,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:19,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:19,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:19,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:19,990 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:14:19,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-04-26 16:14:19,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:19,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:19,998 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:19,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-04-26 16:14:19,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:14:20,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:14:20,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:14:20,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:14:20,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:14:20,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:14:20,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:14:20,019 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:14:20,037 INFO L436 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2025-04-26 16:14:20,038 INFO L437 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-04-26 16:14:20,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:14:20,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:14:20,039 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:14:20,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-04-26 16:14:20,041 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:14:20,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-04-26 16:14:20,057 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:14:20,057 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:14:20,057 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork0_~i~1, v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_3, ~A~0.offset) = -4*thread2Thread1of1ForFork0_~i~1 + 1*v_rep(select #length ULTIMATE.start_create_fresh_int_array_#res#1.base)_3 - 1*~A~0.offset Supporting invariants [] [2025-04-26 16:14:20,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-04-26 16:14:20,077 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-04-26 16:14:20,080 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-04-26 16:14:20,080 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-04-26 16:14:20,080 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~A~0!offset [2025-04-26 16:14:20,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:14:20,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-04-26 16:14:20,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-04-26 16:14:20,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:20,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:20,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:14:20,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:14:20,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:14:20,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:14:20,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:14:20,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:14:20,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:14:20,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:14:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:14:20,298 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2025-04-26 16:14:20,298 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8783 states and 37506 transitions. cyclomatic complexity: 29407 Second operand has 8 states, 8 states have (on average 10.125) internal successors, (in total 81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:20,561 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8783 states and 37506 transitions. cyclomatic complexity: 29407. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (in total 81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 24360 states and 109670 transitions. Complement of second has 11 states. [2025-04-26 16:14:20,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:14:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.125) internal successors, (in total 81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:14:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2025-04-26 16:14:20,563 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 238 transitions. Stem has 83 letters. Loop has 5 letters. [2025-04-26 16:14:20,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:20,563 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 238 transitions. Stem has 88 letters. Loop has 5 letters. [2025-04-26 16:14:20,564 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:20,564 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 238 transitions. Stem has 83 letters. Loop has 10 letters. [2025-04-26 16:14:20,564 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:14:20,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24360 states and 109670 transitions. [2025-04-26 16:14:20,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:14:20,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24360 states to 0 states and 0 transitions. [2025-04-26 16:14:20,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:14:20,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:14:20,838 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:14:20,838 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:14:20,838 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:14:20,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:14:20,839 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:14:20,839 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:14:20,839 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:14:20,839 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:14:20,839 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:14:20,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:14:20 BoogieIcfgContainer [2025-04-26 16:14:20,844 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:14:20,844 INFO L158 Benchmark]: Toolchain (without parser) took 16591.18ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 935.3MB). Free memory was 99.6MB in the beginning and 618.7MB in the end (delta: -519.1MB). Peak memory consumption was 412.9MB. Max. memory is 8.0GB. [2025-04-26 16:14:20,844 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 85.9MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:14:20,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.63ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 85.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:14:20,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.10ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:14:20,845 INFO L158 Benchmark]: Boogie Preprocessor took 39.02ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:14:20,845 INFO L158 Benchmark]: RCFGBuilder took 422.07ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 58.5MB in the end (delta: 23.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 16:14:20,845 INFO L158 Benchmark]: BuchiAutomizer took 15835.08ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 935.3MB). Free memory was 57.7MB in the beginning and 618.7MB in the end (delta: -561.0MB). Peak memory consumption was 370.9MB. Max. memory is 8.0GB. [2025-04-26 16:14:20,846 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.17ms. Allocated memory is still 159.4MB. Free memory was 86.1MB in the beginning and 85.9MB in the end (delta: 188.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 260.63ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 85.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.10ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 83.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 39.02ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 422.07ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 58.5MB in the end (delta: 23.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 15835.08ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 935.3MB). Free memory was 57.7MB in the beginning and 618.7MB in the end (delta: -561.0MB). Peak memory consumption was 370.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~A~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.7s. Construction of modules took 0.5s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 1.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4712 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 1.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1687 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1685 mSDsluCounter, 3897 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3097 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1081 IncrementalHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 800 mSDtfsCounter, 1081 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax121 hnf100 lsp82 ukn64 mio100 lsp35 div150 bol100 ite100 ukn100 eq153 hnf92 smp83 dnf101 smp98 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (size + ((long long) -1 * i)) and consists of 6 locations. One deterministic module has affine ranking function null and consists of 13 locations. One deterministic module has affine ranking function (((long long) -1 * i) + N) and consists of 5 locations. One deterministic module has affine ranking function null and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 28 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:14:20,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:14:21,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...