./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-25 00:17:02,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:17:02,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:17:02,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:17:02,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:17:02,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:17:02,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:17:02,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:17:02,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:17:02,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:17:02,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:17:02,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:17:02,225 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:17:02,226 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:17:02,226 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:17:02,226 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:17:02,227 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:17:02,227 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:17:02,227 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:17:02,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:17:02,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:17:02,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:17:02,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:17:02,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:17:02,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:17:02,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:17:02,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:17:02,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:17:02,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:17:02,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:17:02,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:17:02,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:17:02,235 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:17:02,235 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:17:02,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:17:02,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:17:02,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:17:02,237 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:17:02,238 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:17:02,238 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 50151fd5b174ebc91ead294b24e8609853135da34cf3135980023271fd7c21f6 [2024-10-25 00:17:02,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:17:02,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:17:02,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:17:02,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:17:02,509 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:17:02,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2024-10-25 00:17:04,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:17:04,330 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:17:04,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2024-10-25 00:17:04,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfa0df77/b6ef66d0c0bc487a99cfa64a8085d3c4/FLAG74b4f32d5 [2024-10-25 00:17:04,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbfa0df77/b6ef66d0c0bc487a99cfa64a8085d3c4 [2024-10-25 00:17:04,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:17:04,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:17:04,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:17:04,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:17:04,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:17:04,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:04,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd6e1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04, skipping insertion in model container [2024-10-25 00:17:04,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:04,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:17:04,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:17:04,854 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:17:04,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:17:04,949 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:17:04,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04 WrapperNode [2024-10-25 00:17:04,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:17:04,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:17:04,951 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:17:04,951 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:17:04,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:04,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,051 INFO L138 Inliner]: procedures = 166, calls = 79, calls flagged for inlining = 30, calls inlined = 7, statements flattened = 101 [2024-10-25 00:17:05,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:17:05,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:17:05,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:17:05,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:17:05,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,108 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-10-25 00:17:05,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:17:05,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:17:05,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:17:05,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:17:05,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (1/1) ... [2024-10-25 00:17:05,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:05,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:05,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:05,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-25 00:17:05,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-25 00:17:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:17:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-25 00:17:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-25 00:17:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-25 00:17:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-25 00:17:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 00:17:05,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-25 00:17:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-25 00:17:05,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:17:05,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:17:05,373 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:17:05,375 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:17:05,566 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-25 00:17:05,566 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:17:05,577 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:17:05,577 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-25 00:17:05,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:17:05 BoogieIcfgContainer [2024-10-25 00:17:05,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:17:05,579 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:17:05,579 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:17:05,582 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:17:05,583 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:17:05,583 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:17:04" (1/3) ... [2024-10-25 00:17:05,585 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@738ee020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:17:05, skipping insertion in model container [2024-10-25 00:17:05,585 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:17:05,585 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:17:04" (2/3) ... [2024-10-25 00:17:05,585 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@738ee020 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:17:05, skipping insertion in model container [2024-10-25 00:17:05,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:17:05,586 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:17:05" (3/3) ... [2024-10-25 00:17:05,587 INFO L332 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2024-10-25 00:17:05,643 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:17:05,643 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:17:05,643 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:17:05,645 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:17:05,646 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:17:05,646 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:17:05,646 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:17:05,646 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:17:05,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:05,665 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2024-10-25 00:17:05,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:17:05,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:17:05,670 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-25 00:17:05,670 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:17:05,670 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:17:05,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:05,672 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2024-10-25 00:17:05,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:17:05,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:17:05,673 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-25 00:17:05,673 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:17:05,678 INFO L745 eck$LassoCheckResult]: Stem: 26#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 24#L526true assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 19#ldv_malloc_returnLabel#1true entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 16#L787true assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 10#L788-3true [2024-10-25 00:17:05,678 INFO L747 eck$LassoCheckResult]: Loop: 10#L788-3true assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 2#L788-2true entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 10#L788-3true [2024-10-25 00:17:05,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:05,685 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2024-10-25 00:17:05,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:05,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234993849] [2024-10-25 00:17:05,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:05,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:17:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:17:05,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:17:05,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234993849] [2024-10-25 00:17:05,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234993849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:17:05,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:17:05,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:17:05,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542768790] [2024-10-25 00:17:05,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:17:05,990 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:17:05,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:05,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2024-10-25 00:17:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121905740] [2024-10-25 00:17:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:06,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:06,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:17:06,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:17:06,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:17:06,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:17:06,202 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:17:06,248 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-25 00:17:06,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2024-10-25 00:17:06,253 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-10-25 00:17:06,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 27 transitions. [2024-10-25 00:17:06,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-25 00:17:06,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-10-25 00:17:06,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2024-10-25 00:17:06,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:17:06,259 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-25 00:17:06,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2024-10-25 00:17:06,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-10-25 00:17:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-25 00:17:06,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-25 00:17:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 00:17:06,288 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-25 00:17:06,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:17:06,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2024-10-25 00:17:06,290 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2024-10-25 00:17:06,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:17:06,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:17:06,291 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-25 00:17:06,291 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:17:06,291 INFO L745 eck$LassoCheckResult]: Stem: 85#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 77#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 78#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 72#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 67#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 66#L788-3 [2024-10-25 00:17:06,291 INFO L747 eck$LassoCheckResult]: Loop: 66#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 65#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 66#L788-3 [2024-10-25 00:17:06,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2024-10-25 00:17:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:06,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546334274] [2024-10-25 00:17:06,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:06,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:06,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:06,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:17:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2024-10-25 00:17:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802955539] [2024-10-25 00:17:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:06,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:06,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:17:06,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2024-10-25 00:17:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:06,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529835230] [2024-10-25 00:17:06,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:06,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:06,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:06,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:17:06,857 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:17:06,858 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:17:06,858 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:17:06,858 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:17:06,858 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:17:06,858 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:06,859 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:17:06,859 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:17:06,859 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2024-10-25 00:17:06,860 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:17:06,860 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:17:06,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:06,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:06,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:06,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:06,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:06,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:06,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:06,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:17:07,448 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:17:07,453 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:17:07,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,456 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-25 00:17:07,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:17:07,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:17:07,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:17:07,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-25 00:17:07,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,502 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-25 00:17:07,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:17:07,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:17:07,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:17:07,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-25 00:17:07,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,548 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-25 00:17:07,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:17:07,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:17:07,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:17:07,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-25 00:17:07,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,586 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-25 00:17:07,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 [2024-10-25 00:17:07,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:17:07,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:17:07,606 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-25 00:17:07,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,625 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-25 00:17:07,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:17:07,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:17:07,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-25 00:17:07,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-25 00:17:07,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 [2024-10-25 00:17:07,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:17:07,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:17:07,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:17:07,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-25 00:17:07,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,710 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-25 00:17:07,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:17:07,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:17:07,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:17:07,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-25 00:17:07,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,741 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-25 00:17:07,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:17:07,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:17:07,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-25 00:17:07,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,778 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-25 00:17:07,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:17:07,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:17:07,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-25 00:17:07,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,819 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-25 00:17:07,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:17:07,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:17:07,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:17:07,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-25 00:17:07,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,860 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-25 00:17:07,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 [2024-10-25 00:17:07,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:17:07,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:17:07,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:17:07,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-25 00:17:07,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,898 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-25 00:17:07,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:17:07,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:17:07,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:17:07,916 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-25 00:17:07,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,934 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-25 00:17:07,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:07,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:07,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:07,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:07,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:07,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:17:07,952 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:17:07,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:07,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-25 00:17:07,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:07,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:07,973 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:07,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-25 00:17:07,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:08,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:08,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:08,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:08,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:08,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:17:08,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:17:08,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:08,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-25 00:17:08,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:08,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:08,031 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:08,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-25 00:17:08,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:08,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:08,047 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-25 00:17:08,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:08,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:08,052 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-25 00:17:08,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:17:08,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:08,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-25 00:17:08,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:08,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:08,075 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:08,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-25 00:17:08,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:08,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:08,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:08,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:08,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:08,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:17:08,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:17:08,094 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:17:08,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-25 00:17:08,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:08,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:08,113 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:08,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-25 00:17:08,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:17:08,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:17:08,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:17:08,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:17:08,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:17:08,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:17:08,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:17:08,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:17:08,198 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-10-25 00:17:08,198 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-10-25 00:17:08,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:17:08,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:08,219 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:17:08,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-25 00:17:08,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:17:08,236 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:17:08,236 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:17:08,237 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~i~2#1, ULTIMATE.start_entry_point_~len~0#1) = -1*ULTIMATE.start_entry_point_~i~2#1 + 1*ULTIMATE.start_entry_point_~len~0#1 Supporting invariants [] [2024-10-25 00:17:08,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-25 00:17:08,261 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-25 00:17:08,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:17:08,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:17:08,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:17:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:17:08,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:17:08,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:17:08,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:17:08,352 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-25 00:17:08,353 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:08,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 30 transitions. Complement of second has 5 states. [2024-10-25 00:17:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-25 00:17:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-10-25 00:17:08,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-25 00:17:08,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:17:08,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2024-10-25 00:17:08,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:17:08,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-25 00:17:08,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:17:08,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2024-10-25 00:17:08,398 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:17:08,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 28 transitions. [2024-10-25 00:17:08,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-25 00:17:08,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-25 00:17:08,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2024-10-25 00:17:08,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:17:08,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-25 00:17:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2024-10-25 00:17:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-25 00:17:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-25 00:17:08,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-25 00:17:08,401 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-25 00:17:08,402 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:17:08,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2024-10-25 00:17:08,402 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:17:08,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:17:08,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:17:08,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:17:08,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:17:08,403 INFO L745 eck$LassoCheckResult]: Stem: 183#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 175#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 176#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 170#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 164#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 165#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 181#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 178#L764-3 [2024-10-25 00:17:08,404 INFO L747 eck$LassoCheckResult]: Loop: 178#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 182#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 177#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 171#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 173#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 178#L764-3 [2024-10-25 00:17:08,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2024-10-25 00:17:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555711641] [2024-10-25 00:17:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:17:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:17:08,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:17:08,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555711641] [2024-10-25 00:17:08,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555711641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:17:08,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:17:08,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:17:08,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105404250] [2024-10-25 00:17:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:17:08,496 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:17:08,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2024-10-25 00:17:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:08,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153053889] [2024-10-25 00:17:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:08,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:08,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:17:08,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:17:08,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:17:08,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:17:08,738 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:17:08,758 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-25 00:17:08,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2024-10-25 00:17:08,759 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:17:08,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2024-10-25 00:17:08,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-25 00:17:08,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-25 00:17:08,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-10-25 00:17:08,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:17:08,760 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-25 00:17:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-10-25 00:17:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-25 00:17:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-10-25 00:17:08,762 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-25 00:17:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 00:17:08,763 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-25 00:17:08,763 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:17:08,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-10-25 00:17:08,764 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:17:08,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:17:08,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:17:08,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:17:08,765 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:17:08,765 INFO L745 eck$LassoCheckResult]: Stem: 235#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 227#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 228#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 222#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 216#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 217#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 214#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 215#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 233#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 230#L764-3 [2024-10-25 00:17:08,765 INFO L747 eck$LassoCheckResult]: Loop: 230#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 234#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 229#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 223#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 225#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 230#L764-3 [2024-10-25 00:17:08,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:08,766 INFO L85 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2024-10-25 00:17:08,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:08,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781594374] [2024-10-25 00:17:08,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:08,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:17:08,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:17:08,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:17:08,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781594374] [2024-10-25 00:17:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781594374] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:17:08,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002064060] [2024-10-25 00:17:08,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:08,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:17:08,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:08,880 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:17:08,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-25 00:17:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:17:08,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:17:08,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:17:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:17:08,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:17:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:17:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002064060] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:17:09,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:17:09,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-25 00:17:09,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524664450] [2024-10-25 00:17:09,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:17:09,037 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:17:09,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2024-10-25 00:17:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:09,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554491490] [2024-10-25 00:17:09,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:09,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:09,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:09,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:17:09,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:17:09,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-25 00:17:09,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-25 00:17:09,281 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 9 Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:17:09,330 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-10-25 00:17:09,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2024-10-25 00:17:09,331 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:17:09,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 33 transitions. [2024-10-25 00:17:09,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-25 00:17:09,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-25 00:17:09,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2024-10-25 00:17:09,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:17:09,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-25 00:17:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2024-10-25 00:17:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-25 00:17:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-25 00:17:09,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-25 00:17:09,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:17:09,337 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-25 00:17:09,337 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:17:09,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2024-10-25 00:17:09,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:17:09,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:17:09,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:17:09,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:17:09,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:17:09,340 INFO L745 eck$LassoCheckResult]: Stem: 352#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 343#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 340#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 331#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 332#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 348#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 349#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 329#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 330#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 356#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 355#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 354#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 353#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 350#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 345#L764-3 [2024-10-25 00:17:09,340 INFO L747 eck$LassoCheckResult]: Loop: 345#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 351#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 344#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 337#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 339#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 345#L764-3 [2024-10-25 00:17:09,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:09,341 INFO L85 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 2 times [2024-10-25 00:17:09,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:09,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930614138] [2024-10-25 00:17:09,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:09,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:17:09,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-25 00:17:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:17:09,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:17:09,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930614138] [2024-10-25 00:17:09,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930614138] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:17:09,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716836971] [2024-10-25 00:17:09,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:17:09,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:17:09,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:17:09,530 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 00:17:09,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-25 00:17:09,605 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:17:09,605 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:17:09,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-25 00:17:09,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:17:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:17:09,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:17:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:17:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716836971] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:17:09,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:17:09,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-25 00:17:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339964968] [2024-10-25 00:17:09,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:17:09,785 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:17:09,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2024-10-25 00:17:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232445219] [2024-10-25 00:17:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:09,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:09,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:17:10,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:17:10,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-25 00:17:10,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-10-25 00:17:10,020 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 9 Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:17:10,144 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-10-25 00:17:10,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2024-10-25 00:17:10,145 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:17:10,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 45 transitions. [2024-10-25 00:17:10,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-25 00:17:10,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-25 00:17:10,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 45 transitions. [2024-10-25 00:17:10,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:17:10,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-25 00:17:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 45 transitions. [2024-10-25 00:17:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-25 00:17:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.125) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:17:10,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-10-25 00:17:10,152 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-25 00:17:10,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-25 00:17:10,153 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-25 00:17:10,153 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:17:10,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2024-10-25 00:17:10,154 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:17:10,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:17:10,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:17:10,155 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:17:10,155 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-25 00:17:10,156 INFO L745 eck$LassoCheckResult]: Stem: 536#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 526#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 527#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 521#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 515#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 516#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 532#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 533#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 513#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 514#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 552#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 551#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 550#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 549#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 548#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 547#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 546#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 545#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 544#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 543#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 542#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 541#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 540#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 539#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 538#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 537#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 534#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 529#L764-3 [2024-10-25 00:17:10,156 INFO L747 eck$LassoCheckResult]: Loop: 529#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 535#L526-1 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 528#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 522#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 524#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 529#L764-3 [2024-10-25 00:17:10,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:10,156 INFO L85 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 3 times [2024-10-25 00:17:10,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:10,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053435988] [2024-10-25 00:17:10,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:10,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:10,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:10,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:10,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:17:10,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:10,229 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2024-10-25 00:17:10,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:10,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44426802] [2024-10-25 00:17:10,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:10,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:10,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:17:10,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:17:10,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2024-10-25 00:17:10,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:17:10,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359911804] [2024-10-25 00:17:10,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:17:10,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:17:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:10,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:17:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:17:10,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:28,484 WARN L286 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 342 DAG size of output: 294 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-25 00:18:29,119 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:18:29,119 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:18:29,119 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:18:29,119 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:18:29,120 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:18:29,120 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:29,120 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:18:29,120 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:18:29,120 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration6_Lasso [2024-10-25 00:18:29,120 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:18:29,120 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:18:29,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:29,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:29,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,151 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:18:30,728 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:18:30,728 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:18:30,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:30,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:30,734 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:30,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-25 00:18:30,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:30,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:30,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:30,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:30,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:30,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:30,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:30,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:30,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:30,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:30,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:30,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:30,762 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:30,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-25 00:18:30,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:30,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:30,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:30,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:30,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:30,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:30,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:30,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:30,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:30,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:30,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:30,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:30,788 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:30,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-25 00:18:30,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:30,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:30,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:30,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:30,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:30,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:30,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:30,805 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:30,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-25 00:18:30,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:30,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:30,824 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:30,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-25 00:18:30,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:30,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:30,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:30,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:30,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:30,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:30,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:30,848 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:30,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:30,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:30,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:30,865 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:30,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-10-25 00:18:30,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:30,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:30,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:30,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:30,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:30,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:30,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:30,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:30,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:30,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:30,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:30,896 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:30,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-10-25 00:18:30,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:30,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:30,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:30,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:30,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:30,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:30,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:30,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:30,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:30,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:30,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:30,928 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:30,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-10-25 00:18:30,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:30,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:30,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:30,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:30,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:30,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:30,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:30,949 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:30,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:30,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:30,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:30,963 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:30,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-10-25 00:18:30,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:30,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:30,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:30,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:30,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:30,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:30,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:30,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:30,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:30,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:30,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:30,996 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:30,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-10-25 00:18:30,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,026 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-10-25 00:18:31,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,047 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-10-25 00:18:31,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,065 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-10-25 00:18:31,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,088 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-25 00:18:31,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,106 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-10-25 00:18:31,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-10-25 00:18:31,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,145 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2024-10-25 00:18:31,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,176 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2024-10-25 00:18:31,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 [2024-10-25 00:18:31,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:31,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:31,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:31,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,201 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2024-10-25 00:18:31,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-25 00:18:31,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,232 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2024-10-25 00:18:31,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:31,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:31,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:31,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,262 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-10-25 00:18:31,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,276 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,276 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,279 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-10-25 00:18:31,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,291 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2024-10-25 00:18:31,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-10-25 00:18:31,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,319 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2024-10-25 00:18:31,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-25 00:18:31,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,354 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2024-10-25 00:18:31,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,392 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-10-25 00:18:31,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:31,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:31,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:31,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,424 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-10-25 00:18:31,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,443 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,464 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-10-25 00:18:31,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,489 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,503 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-10-25 00:18:31,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 [2024-10-25 00:18:31,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-25 00:18:31,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,537 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-10-25 00:18:31,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:31,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:31,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:31,552 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2024-10-25 00:18:31,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,565 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-10-25 00:18:31,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,583 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-10-25 00:18:31,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,600 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-10-25 00:18:31,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:31,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:31,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:31,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,627 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-10-25 00:18:31,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 [2024-10-25 00:18:31,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:31,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:31,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:31,640 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-10-25 00:18:31,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,653 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-10-25 00:18:31,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,666 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-25 00:18:31,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,668 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-25 00:18:31,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-10-25 00:18:31,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,687 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-10-25 00:18:31,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,708 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,727 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-10-25 00:18:31,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,757 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-10-25 00:18:31,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,773 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,785 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-10-25 00:18:31,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:18:31,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:18:31,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:18:31,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-25 00:18:31,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,818 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2024-10-25 00:18:31,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,838 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:18:31,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,850 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2024-10-25 00:18:31,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:18:31,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:18:31,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:18:31,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:18:31,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:18:31,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:18:31,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:18:31,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:18:31,906 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-25 00:18:31,906 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-25 00:18:31,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:18:31,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:18:31,908 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-25 00:18:31,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2024-10-25 00:18:31,909 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:18:31,920 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:18:31,920 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:18:31,920 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~len#1, ULTIMATE.start_alloc_17_~i~0#1) = 1*ULTIMATE.start_alloc_17_~len#1 - 1*ULTIMATE.start_alloc_17_~i~0#1 Supporting invariants [] [2024-10-25 00:18:31,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:31,953 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-25 00:18:31,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:32,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:18:32,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:32,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-10-25 00:18:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:32,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:18:32,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:18:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:18:32,145 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-25 00:18:32,145 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:18:32,176 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 45 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 54 transitions. Complement of second has 5 states. [2024-10-25 00:18:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-25 00:18:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:18:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-10-25 00:18:32,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 27 letters. Loop has 5 letters. [2024-10-25 00:18:32,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:32,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 32 letters. Loop has 5 letters. [2024-10-25 00:18:32,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:32,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 27 letters. Loop has 10 letters. [2024-10-25 00:18:32,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:18:32,181 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-10-25 00:18:32,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-25 00:18:32,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 52 transitions. [2024-10-25 00:18:32,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-25 00:18:32,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-25 00:18:32,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2024-10-25 00:18:32,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:18:32,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-25 00:18:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2024-10-25 00:18:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-25 00:18:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:18:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-10-25 00:18:32,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-25 00:18:32,189 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-25 00:18:32,189 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:18:32,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2024-10-25 00:18:32,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-25 00:18:32,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:32,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:32,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:32,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:18:32,192 INFO L745 eck$LassoCheckResult]: Stem: 766#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 753#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 754#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 751#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 741#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 742#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 760#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 761#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 739#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 740#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 782#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 781#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 780#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 779#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 778#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 777#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 776#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 775#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 774#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 773#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 772#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 771#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 770#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 769#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 768#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 767#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 762#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 763#L764-3 assume !(alloc_17_~i~0#1 < alloc_17_~len#1); 745#L764-4 alloc_17_#res#1 := 0; 746#alloc_17_returnLabel#1 entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0; 744#L779-3 [2024-10-25 00:18:32,193 INFO L747 eck$LassoCheckResult]: Loop: 744#L779-3 assume !!(free_17_~i~1#1 < free_17_~len#1);call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset; 743#L779-2 free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1; 744#L779-3 [2024-10-25 00:18:32,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:32,194 INFO L85 PathProgramCache]: Analyzing trace with hash 999709617, now seen corresponding path program 1 times [2024-10-25 00:18:32,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:32,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203401969] [2024-10-25 00:18:32,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:32,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-25 00:18:32,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:32,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203401969] [2024-10-25 00:18:32,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203401969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:32,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:32,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:18:32,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035405985] [2024-10-25 00:18:32,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:32,358 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:18:32,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2024-10-25 00:18:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:32,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860951698] [2024-10-25 00:18:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:32,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:32,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:32,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:32,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:18:32,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:18:32,407 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:18:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:32,437 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-10-25 00:18:32,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 61 transitions. [2024-10-25 00:18:32,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-25 00:18:32,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 61 transitions. [2024-10-25 00:18:32,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-25 00:18:32,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-25 00:18:32,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 61 transitions. [2024-10-25 00:18:32,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:18:32,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-10-25 00:18:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 61 transitions. [2024-10-25 00:18:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-10-25 00:18:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:18:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-25 00:18:32,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-25 00:18:32,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 00:18:32,443 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-25 00:18:32,443 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:18:32,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2024-10-25 00:18:32,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-25 00:18:32,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:32,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:32,444 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:32,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:18:32,445 INFO L745 eck$LassoCheckResult]: Stem: 870#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 859#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 852#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 846#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 847#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 844#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 845#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 865#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 887#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 886#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 885#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 884#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 883#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 882#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 881#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 880#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 879#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 878#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 877#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 876#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 875#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 874#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 873#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 872#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 871#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 866#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 867#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 868#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 860#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 853#L766 assume alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0; 854#alloc_17_err#1 alloc_17_~j~0#1 := alloc_17_~i~0#1 - 1; 857#L771-3 [2024-10-25 00:18:32,445 INFO L747 eck$LassoCheckResult]: Loop: 857#L771-3 assume !!(alloc_17_~j~0#1 >= 0);call alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset := read~$Pointer$#1(alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~j~0#1, 4);call ULTIMATE.dealloc(alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset);havoc alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset;call write~$Pointer$#1(0, 0, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~j~0#1, 4); 864#L771-2 alloc_17_#t~post45#1 := alloc_17_~j~0#1;alloc_17_~j~0#1 := alloc_17_#t~post45#1 - 1;havoc alloc_17_#t~post45#1; 857#L771-3 [2024-10-25 00:18:32,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1350299059, now seen corresponding path program 1 times [2024-10-25 00:18:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:32,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391302111] [2024-10-25 00:18:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:32,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:32,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:32,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:32,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2024-10-25 00:18:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578575913] [2024-10-25 00:18:32,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:32,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:32,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:32,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash -557270321, now seen corresponding path program 1 times [2024-10-25 00:18:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226664136] [2024-10-25 00:18:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-25 00:18:32,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:32,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226664136] [2024-10-25 00:18:32,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226664136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:32,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:18:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655668194] [2024-10-25 00:18:32,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:18:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:18:32,715 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:18:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:32,748 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-10-25 00:18:32,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2024-10-25 00:18:32,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-25 00:18:32,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 62 transitions. [2024-10-25 00:18:32,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-25 00:18:32,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-25 00:18:32,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 62 transitions. [2024-10-25 00:18:32,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:18:32,750 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-10-25 00:18:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 62 transitions. [2024-10-25 00:18:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-10-25 00:18:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.163265306122449) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:18:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-10-25 00:18:32,752 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-25 00:18:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 00:18:32,755 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-25 00:18:32,755 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-25 00:18:32,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2024-10-25 00:18:32,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-25 00:18:32,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:32,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:32,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:32,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:18:32,757 INFO L745 eck$LassoCheckResult]: Stem: 977#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 964#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 965#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 958#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 952#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 953#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 950#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 951#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 972#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 998#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 997#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 996#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 995#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 994#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 993#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 992#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 991#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 990#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 989#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 988#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 987#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 986#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 985#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 983#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 980#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 979#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 973#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 974#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 976#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 967#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 961#L766 assume !(alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0);call write~$Pointer$#1(alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~array#1.base, alloc_17_~array#1.offset + 4 * alloc_17_~i~0#1, 4); 962#L764-2 alloc_17_#t~post43#1 := alloc_17_~i~0#1;alloc_17_~i~0#1 := 1 + alloc_17_#t~post43#1;havoc alloc_17_#t~post43#1; 968#L764-3 assume !(alloc_17_~i~0#1 < alloc_17_~len#1); 956#L764-4 alloc_17_#res#1 := 0; 957#alloc_17_returnLabel#1 entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0; 955#L779-3 [2024-10-25 00:18:32,757 INFO L747 eck$LassoCheckResult]: Loop: 955#L779-3 assume !!(free_17_~i~1#1 < free_17_~len#1);call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset; 954#L779-2 free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1; 955#L779-3 [2024-10-25 00:18:32,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash -93871603, now seen corresponding path program 1 times [2024-10-25 00:18:32,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:32,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892080766] [2024-10-25 00:18:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:32,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:18:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-25 00:18:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:18:32,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892080766] [2024-10-25 00:18:32,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892080766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:18:32,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:18:32,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:18:32,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213200056] [2024-10-25 00:18:32,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:18:32,893 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:18:32,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2024-10-25 00:18:32,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:32,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262942680] [2024-10-25 00:18:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:32,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:32,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:32,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:18:32,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:18:32,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:18:32,943 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:18:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:18:32,963 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-10-25 00:18:32,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2024-10-25 00:18:32,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-25 00:18:32,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 60 transitions. [2024-10-25 00:18:32,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-25 00:18:32,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-25 00:18:32,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 60 transitions. [2024-10-25 00:18:32,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:18:32,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-10-25 00:18:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 60 transitions. [2024-10-25 00:18:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-10-25 00:18:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:18:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-10-25 00:18:32,968 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-10-25 00:18:32,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 00:18:32,969 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-10-25 00:18:32,969 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-25 00:18:32,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2024-10-25 00:18:32,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-25 00:18:32,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:18:32,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:18:32,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:18:32,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-25 00:18:32,971 INFO L745 eck$LassoCheckResult]: Stem: 1091#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(8, 1);~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1, 0;call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$#0(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~post49#1, entry_point_#t~ret50#1, entry_point_~i~2#1, entry_point_~len~0#1, entry_point_~array~0#1.base, entry_point_~array~0#1.offset;havoc entry_point_~i~2#1;entry_point_~len~0#1 := 10;assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4 * entry_point_~len~0#1;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 1077#L526 assume 0 != ldv_malloc_#t~nondet11#1;havoc ldv_malloc_#t~nondet11#1;call ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset := #Ultimate.allocOnHeap(ldv_malloc_~size#1 % 4294967296);ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset;havoc ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset; 1073#ldv_malloc_returnLabel#1 entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;entry_point_~array~0#1.base, entry_point_~array~0#1.offset := entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; 1063#L787 assume entry_point_~array~0#1.base != 0 || entry_point_~array~0#1.offset != 0;entry_point_~i~2#1 := 0; 1064#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1061#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1062#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1085#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1108#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1107#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1106#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1105#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1104#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1103#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1102#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1101#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1100#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1099#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1098#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1097#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1096#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1095#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1094#L788-3 assume !!(entry_point_~i~2#1 < entry_point_~len~0#1);call write~$Pointer$#1(0, 0, entry_point_~array~0#1.base, entry_point_~array~0#1.offset + 4 * entry_point_~i~2#1, 4); 1093#L788-2 entry_point_#t~post49#1 := entry_point_~i~2#1;entry_point_~i~2#1 := 1 + entry_point_#t~post49#1;havoc entry_point_#t~post49#1; 1092#L788-3 assume !(entry_point_~i~2#1 < entry_point_~len~0#1); 1086#L788-4 assume { :begin_inline_alloc_17 } true;alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;alloc_17_~array#1.base, alloc_17_~array#1.offset := alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset;alloc_17_~len#1 := alloc_17_#in~len#1;havoc alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset;alloc_17_~i~0#1 := 0;havoc alloc_17_~j~0#1; 1087#L764-3 assume !!(alloc_17_~i~0#1 < alloc_17_~len#1);assume { :begin_inline_ldv_malloc } true;ldv_malloc_#in~size#1 := 4;havoc ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;ldv_malloc_~size#1 := ldv_malloc_#in~size#1;havoc ldv_malloc_#t~nondet11#1; 1088#L526-1 assume !(0 != ldv_malloc_#t~nondet11#1);havoc ldv_malloc_#t~nondet11#1;ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset := 0, 0; 1078#ldv_malloc_returnLabel#2 alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset := ldv_malloc_#res#1.base, ldv_malloc_#res#1.offset;havoc ldv_malloc_#t~nondet11#1, ldv_malloc_#t~malloc12#1.base, ldv_malloc_#t~malloc12#1.offset, ldv_malloc_~size#1;havoc ldv_malloc_#in~size#1;assume { :end_inline_ldv_malloc } true;alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset := alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset; 1079#L766 assume alloc_17_~p~0#1.base == 0 && alloc_17_~p~0#1.offset == 0; 1074#alloc_17_err#1 alloc_17_~j~0#1 := alloc_17_~i~0#1 - 1; 1075#L771-3 assume !(alloc_17_~j~0#1 >= 0); 1082#L771-4 alloc_17_#res#1 := 3; 1068#alloc_17_returnLabel#1 entry_point_#t~ret50#1 := alloc_17_#res#1;havoc alloc_17_#t~ret42#1.base, alloc_17_#t~ret42#1.offset, alloc_17_#t~post43#1, alloc_17_#t~mem44#1.base, alloc_17_#t~mem44#1.offset, alloc_17_#t~post45#1, alloc_17_~array#1.base, alloc_17_~array#1.offset, alloc_17_~len#1, alloc_17_~p~0#1.base, alloc_17_~p~0#1.offset, alloc_17_~i~0#1, alloc_17_~j~0#1;havoc alloc_17_#in~array#1.base, alloc_17_#in~array#1.offset, alloc_17_#in~len#1;assume { :end_inline_alloc_17 } true;havoc entry_point_#t~ret50#1;assume { :begin_inline_free_17 } true;free_17_#in~array#1.base, free_17_#in~array#1.offset, free_17_#in~len#1 := entry_point_~array~0#1.base, entry_point_~array~0#1.offset, entry_point_~len~0#1;havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset, free_17_#t~post47#1, free_17_~array#1.base, free_17_~array#1.offset, free_17_~len#1, free_17_~i~1#1;free_17_~array#1.base, free_17_~array#1.offset := free_17_#in~array#1.base, free_17_#in~array#1.offset;free_17_~len#1 := free_17_#in~len#1;havoc free_17_~i~1#1;free_17_~i~1#1 := 0; 1066#L779-3 [2024-10-25 00:18:32,971 INFO L747 eck$LassoCheckResult]: Loop: 1066#L779-3 assume !!(free_17_~i~1#1 < free_17_~len#1);call free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset := read~$Pointer$#1(free_17_~array#1.base, free_17_~array#1.offset + 4 * free_17_~i~1#1, 4);call ULTIMATE.dealloc(free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset);havoc free_17_#t~mem46#1.base, free_17_#t~mem46#1.offset; 1065#L779-2 free_17_#t~post47#1 := free_17_~i~1#1;free_17_~i~1#1 := 1 + free_17_#t~post47#1;havoc free_17_#t~post47#1; 1066#L779-3 [2024-10-25 00:18:32,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash -95512495, now seen corresponding path program 1 times [2024-10-25 00:18:32,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:32,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940348575] [2024-10-25 00:18:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:32,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:33,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:33,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:33,017 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 3 times [2024-10-25 00:18:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:33,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179846600] [2024-10-25 00:18:33,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:33,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:33,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:33,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:18:33,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:18:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1593191981, now seen corresponding path program 1 times [2024-10-25 00:18:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:18:33,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492761487] [2024-10-25 00:18:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:18:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:18:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:33,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:18:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:18:33,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace