./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 61a67961 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-wip.fs.cvc5-61a6796-m [2024-10-15 00:38:28,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 00:38:28,760 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-15 00:38:28,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 00:38:28,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 00:38:28,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 00:38:28,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 00:38:28,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 00:38:28,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 00:38:28,802 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 00:38:28,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 00:38:28,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 00:38:28,804 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 00:38:28,804 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-15 00:38:28,806 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-15 00:38:28,806 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-15 00:38:28,806 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-15 00:38:28,807 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-15 00:38:28,807 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-15 00:38:28,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 00:38:28,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-15 00:38:28,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 00:38:28,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 00:38:28,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 00:38:28,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 00:38:28,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-15 00:38:28,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-15 00:38:28,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-15 00:38:28,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 00:38:28,813 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-15 00:38:28,813 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 00:38:28,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 00:38:28,814 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-15 00:38:28,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 00:38:28,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 00:38:28,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 00:38:28,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 00:38:28,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 00:38:28,818 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-15 00:38:28,818 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-15 00:38:29,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 00:38:29,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 00:38:29,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 00:38:29,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 00:38:29,107 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 00:38:29,108 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-15 00:38:30,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 00:38:30,888 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 00:38:30,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-2.i [2024-10-15 00:38:30,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c797d83/fcff1a0e1beb46f5a731bc0463b7afec/FLAG0b6cc2796 [2024-10-15 00:38:30,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c797d83/fcff1a0e1beb46f5a731bc0463b7afec [2024-10-15 00:38:30,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 00:38:30,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 00:38:30,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 00:38:30,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 00:38:30,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 00:38:30,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:38:30" (1/1) ... [2024-10-15 00:38:30,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50197b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:30, skipping insertion in model container [2024-10-15 00:38:30,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:38:30" (1/1) ... [2024-10-15 00:38:30,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 00:38:31,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:38:31,375 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 00:38:31,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 00:38:31,485 INFO L204 MainTranslator]: Completed translation [2024-10-15 00:38:31,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31 WrapperNode [2024-10-15 00:38:31,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 00:38:31,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 00:38:31,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 00:38:31,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 00:38:31,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,536 INFO L138 Inliner]: procedures = 166, calls = 79, calls flagged for inlining = 30, calls inlined = 7, statements flattened = 101 [2024-10-15 00:38:31,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 00:38:31,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 00:38:31,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 00:38:31,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 00:38:31,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,553 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,569 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-15 00:38:31,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 00:38:31,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 00:38:31,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 00:38:31,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 00:38:31,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (1/1) ... [2024-10-15 00:38:31,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:31,624 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-15 00:38:31,626 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-15 00:38:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-15 00:38:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 00:38:31,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-15 00:38:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-15 00:38:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-15 00:38:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-15 00:38:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 00:38:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-15 00:38:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-15 00:38:31,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 00:38:31,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 00:38:31,779 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 00:38:31,781 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 00:38:31,937 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-15 00:38:31,937 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 00:38:31,954 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 00:38:31,954 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-15 00:38:31,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:38:31 BoogieIcfgContainer [2024-10-15 00:38:31,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 00:38:31,956 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-15 00:38:31,956 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-15 00:38:31,963 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-15 00:38:31,964 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:38:31,964 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.10 12:38:30" (1/3) ... [2024-10-15 00:38:31,965 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e729dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:38:31, skipping insertion in model container [2024-10-15 00:38:31,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:38:31,966 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:38:31" (2/3) ... [2024-10-15 00:38:31,966 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e729dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.10 12:38:31, skipping insertion in model container [2024-10-15 00:38:31,966 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-15 00:38:31,966 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:38:31" (3/3) ... [2024-10-15 00:38:31,968 INFO L332 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_1-2.i [2024-10-15 00:38:32,016 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-15 00:38:32,016 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-15 00:38:32,017 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-15 00:38:32,017 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-15 00:38:32,017 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-15 00:38:32,018 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-15 00:38:32,019 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-15 00:38:32,019 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-15 00:38:32,023 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-15 00:38:32,044 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2024-10-15 00:38:32,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:32,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:32,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:38:32,053 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:38:32,053 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-15 00:38:32,053 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-15 00:38:32,055 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2024-10-15 00:38:32,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:32,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:32,056 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:38:32,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:38:32,063 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-15 00:38:32,064 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-15 00:38:32,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:32,075 INFO L85 PathProgramCache]: Analyzing trace with hash 28695751, now seen corresponding path program 1 times [2024-10-15 00:38:32,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:32,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791811682] [2024-10-15 00:38:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:32,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:32,372 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-15 00:38:32,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:38:32,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791811682] [2024-10-15 00:38:32,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791811682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:38:32,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:38:32,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 00:38:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033069215] [2024-10-15 00:38:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:38:32,386 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:38:32,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:32,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 1 times [2024-10-15 00:38:32,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:32,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828370038] [2024-10-15 00:38:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:32,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:32,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:38:32,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:38:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:38:32,604 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-15 00:38:32,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:38:32,653 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-15 00:38:32,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2024-10-15 00:38:32,657 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-10-15 00:38:32,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 27 transitions. [2024-10-15 00:38:32,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-10-15 00:38:32,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-10-15 00:38:32,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2024-10-15 00:38:32,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:38:32,665 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-15 00:38:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2024-10-15 00:38:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-10-15 00:38:32,726 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-15 00:38:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-10-15 00:38:32,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-15 00:38:32,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:38:32,734 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-10-15 00:38:32,736 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-15 00:38:32,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2024-10-15 00:38:32,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2024-10-15 00:38:32,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:32,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:32,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-10-15 00:38:32,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:38:32,739 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-15 00:38:32,739 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-15 00:38:32,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash 28693829, now seen corresponding path program 1 times [2024-10-15 00:38:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:32,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581601310] [2024-10-15 00:38:32,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:32,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:32,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:32,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:32,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1603, now seen corresponding path program 2 times [2024-10-15 00:38:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912703277] [2024-10-15 00:38:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:32,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:32,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:32,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:32,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966535, now seen corresponding path program 1 times [2024-10-15 00:38:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:32,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383585473] [2024-10-15 00:38:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:32,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:32,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:33,371 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:38:33,372 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:38:33,372 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:38:33,372 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:38:33,373 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:38:33,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:33,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:38:33,373 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:38:33,373 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration2_Lasso [2024-10-15 00:38:33,373 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:38:33,374 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:38:33,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,408 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:38:33,921 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:38:33,925 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:38:33,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:33,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:33,929 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-15 00:38:33,929 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-15 00:38:33,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-15 00:38:33,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:33,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:38:33,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:33,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:33,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:33,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:38:33,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:38:33,951 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:33,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-15 00:38:33,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:33,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:33,970 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-15 00:38:33,971 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-15 00:38:33,972 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-15 00:38:33,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:33,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:38:33,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:33,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:33,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:33,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:38:33,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:38:33,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,003 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-15 00:38:34,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,006 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-15 00:38:34,007 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-15 00:38:34,008 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-15 00:38:34,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:38:34,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:38:34,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:38:34,023 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,038 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-15 00:38:34,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,041 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-15 00:38:34,042 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-15 00:38:34,043 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-15 00:38:34,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:38:34,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:38:34,064 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,079 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-15 00:38:34,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,082 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-15 00:38:34,083 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-15 00:38:34,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:38:34,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:38:34,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:38:34,104 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,119 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-15 00:38:34,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,121 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-15 00:38:34,122 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-15 00:38:34,124 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-15 00:38:34,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:38:34,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:38:34,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:38:34,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,157 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-15 00:38:34,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,160 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-15 00:38:34,161 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-15 00:38:34,162 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-15 00:38:34,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:38:34,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:38:34,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:38:34,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,188 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-15 00:38:34,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,190 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-15 00:38:34,191 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-15 00:38:34,192 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-15 00:38:34,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:38:34,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:38:34,209 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,224 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-15 00:38:34,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,227 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-15 00:38:34,228 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-15 00:38:34,229 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-15 00:38:34,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:38:34,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:38:34,259 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,274 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-15 00:38:34,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,277 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-15 00:38:34,280 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-15 00:38:34,280 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-15 00:38:34,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:38:34,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:38:34,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:38:34,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,310 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-15 00:38:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,316 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-15 00:38:34,317 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-15 00:38:34,318 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-15 00:38:34,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:38:34,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:38:34,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:38:34,336 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-10-15 00:38:34,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,353 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-15 00:38:34,355 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-15 00:38:34,356 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-15 00:38:34,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:38:34,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:38:34,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:38:34,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,387 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-15 00:38:34,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,389 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-15 00:38:34,390 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-15 00:38:34,391 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-15 00:38:34,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:38:34,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:38:34,411 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,425 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-15 00:38:34,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,427 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-15 00:38:34,429 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-15 00:38:34,430 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-15 00:38:34,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:38:34,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:38:34,447 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-15 00:38:34,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,463 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-15 00:38:34,466 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-15 00:38:34,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-15 00:38:34,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,481 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-15 00:38:34,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,485 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-15 00:38:34,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:38:34,490 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,504 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-15 00:38:34,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,507 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-15 00:38:34,508 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-15 00:38:34,509 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-15 00:38:34,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:38:34,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:38:34,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:38:34,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-15 00:38:34,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,548 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-15 00:38:34,550 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-15 00:38:34,551 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-15 00:38:34,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:38:34,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:38:34,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:38:34,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:38:34,570 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:38:34,570 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:38:34,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:38:34,631 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2024-10-15 00:38:34,632 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-10-15 00:38:34,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:38:34,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:34,653 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-15 00:38:34,654 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-15 00:38:34,655 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:38:34,694 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:38:34,695 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:38:34,696 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-15 00:38:34,708 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-15 00:38:34,722 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-10-15 00:38:34,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:34,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:38:34,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:38:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:34,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:38:34,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:38:34,810 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-15 00:38:34,813 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-15 00:38:34,814 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-15 00:38:34,852 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-15 00:38:34,853 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-15 00:38:34,854 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-15 00:38:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2024-10-15 00:38:34,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2024-10-15 00:38:34,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:38:34,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2024-10-15 00:38:34,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:38:34,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2024-10-15 00:38:34,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:38:34,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2024-10-15 00:38:34,858 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:38:34,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 28 transitions. [2024-10-15 00:38:34,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-15 00:38:34,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-15 00:38:34,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2024-10-15 00:38:34,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:38:34,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-15 00:38:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2024-10-15 00:38:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-15 00:38:34,860 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-15 00:38:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-15 00:38:34,862 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-15 00:38:34,862 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-15 00:38:34,862 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-15 00:38:34,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2024-10-15 00:38:34,864 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:38:34,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:34,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:34,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:38:34,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:38:34,864 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-15 00:38:34,865 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-15 00:38:34,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:34,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966477, now seen corresponding path program 1 times [2024-10-15 00:38:34,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:34,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081929863] [2024-10-15 00:38:34,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:34,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:34,950 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-15 00:38:34,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:38:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081929863] [2024-10-15 00:38:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081929863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:38:34,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:38:34,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:38:34,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672426069] [2024-10-15 00:38:34,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:38:34,951 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:38:34,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 1 times [2024-10-15 00:38:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:34,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789827140] [2024-10-15 00:38:34,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:34,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:34,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:38:35,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:38:35,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:38:35,183 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-15 00:38:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:38:35,203 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2024-10-15 00:38:35,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2024-10-15 00:38:35,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:38:35,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2024-10-15 00:38:35,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-15 00:38:35,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-15 00:38:35,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2024-10-15 00:38:35,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:38:35,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-10-15 00:38:35,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2024-10-15 00:38:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-15 00:38:35,208 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-15 00:38:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-10-15 00:38:35,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-15 00:38:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:38:35,210 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-15 00:38:35,210 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-15 00:38:35,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2024-10-15 00:38:35,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:38:35,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:35,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:35,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:38:35,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:38:35,211 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-15 00:38:35,211 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-15 00:38:35,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:35,212 INFO L85 PathProgramCache]: Analyzing trace with hash -593946865, now seen corresponding path program 1 times [2024-10-15 00:38:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:35,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677308376] [2024-10-15 00:38:35,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:35,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:35,301 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-15 00:38:35,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:38:35,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677308376] [2024-10-15 00:38:35,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677308376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:38:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196885553] [2024-10-15 00:38:35,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:35,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:38:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:35,304 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-15 00:38:35,307 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-15 00:38:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:35,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:38:35,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:38:35,406 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-15 00:38:35,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:38:35,435 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-15 00:38:35,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196885553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:38:35,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:38:35,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-15 00:38:35,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44186705] [2024-10-15 00:38:35,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:38:35,436 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:38:35,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 2 times [2024-10-15 00:38:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:35,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871814945] [2024-10-15 00:38:35,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:35,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:35,447 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:35,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:38:35,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 00:38:35,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-10-15 00:38:35,646 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-15 00:38:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:38:35,692 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-10-15 00:38:35,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2024-10-15 00:38:35,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:38:35,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 33 transitions. [2024-10-15 00:38:35,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-15 00:38:35,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-15 00:38:35,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2024-10-15 00:38:35,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:38:35,694 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-15 00:38:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2024-10-15 00:38:35,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-15 00:38:35,696 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-15 00:38:35,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-10-15 00:38:35,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-15 00:38:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 00:38:35,697 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-10-15 00:38:35,697 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-15 00:38:35,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2024-10-15 00:38:35,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:38:35,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:35,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:35,698 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:38:35,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:38:35,699 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-15 00:38:35,699 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-15 00:38:35,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash 775101013, now seen corresponding path program 2 times [2024-10-15 00:38:35,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:35,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786167647] [2024-10-15 00:38:35,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:38:35,812 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-15 00:38:35,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:38:35,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786167647] [2024-10-15 00:38:35,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786167647] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 00:38:35,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98952304] [2024-10-15 00:38:35,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 00:38:35,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 00:38:35,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:38:35,814 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-15 00:38:35,815 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-15 00:38:35,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 00:38:35,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 00:38:35,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 00:38:35,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:38:35,971 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-15 00:38:35,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 00:38:36,072 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-15 00:38:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98952304] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 00:38:36,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 00:38:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-15 00:38:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992963776] [2024-10-15 00:38:36,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 00:38:36,073 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:38:36,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:36,073 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 3 times [2024-10-15 00:38:36,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:36,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519881516] [2024-10-15 00:38:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:36,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:36,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:36,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:36,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:38:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-15 00:38:36,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-10-15 00:38:36,306 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-15 00:38:36,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-10-15 00:38:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:38:36,467 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-10-15 00:38:36,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2024-10-15 00:38:36,468 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:38:36,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 45 transitions. [2024-10-15 00:38:36,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-10-15 00:38:36,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-15 00:38:36,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 45 transitions. [2024-10-15 00:38:36,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-15 00:38:36,469 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-15 00:38:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 45 transitions. [2024-10-15 00:38:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-15 00:38:36,471 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-15 00:38:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-10-15 00:38:36,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-15 00:38:36,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 00:38:36,473 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-10-15 00:38:36,473 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-15 00:38:36,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 45 transitions. [2024-10-15 00:38:36,474 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-15 00:38:36,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:38:36,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:38:36,475 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:38:36,475 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-15 00:38:36,475 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-15 00:38:36,476 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-15 00:38:36,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:36,476 INFO L85 PathProgramCache]: Analyzing trace with hash 158620513, now seen corresponding path program 3 times [2024-10-15 00:38:36,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:36,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177390149] [2024-10-15 00:38:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:36,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:36,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:36,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:36,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:36,529 INFO L85 PathProgramCache]: Analyzing trace with hash 61172007, now seen corresponding path program 4 times [2024-10-15 00:38:36,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428561679] [2024-10-15 00:38:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:36,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:36,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:38:36,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:38:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1350358585, now seen corresponding path program 1 times [2024-10-15 00:38:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:38:36,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059475311] [2024-10-15 00:38:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:38:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:38:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:36,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:38:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:38:36,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:39:43,215 WARN L286 SmtUtils]: Spent 1.11m 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-15 00:39:43,793 INFO L204 LassoAnalysis]: Preferences: [2024-10-15 00:39:43,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-15 00:39:43,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-15 00:39:43,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-15 00:39:43,793 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-15 00:39:43,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:43,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-15 00:39:43,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-15 00:39:43,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_1-2.i_Iteration6_Lasso [2024-10-15 00:39:43,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-15 00:39:43,794 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-15 00:39:43,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:43,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:43,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:44,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-15 00:39:45,114 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-15 00:39:45,114 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-15 00:39:45,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,120 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-15 00:39:45,121 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-15 00:39:45,123 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-15 00:39:45,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:39:45,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:39:45,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:39:45,136 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-15 00:39:45,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,149 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-15 00:39:45,150 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-15 00:39:45,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:39:45,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:39:45,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:39:45,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:39:45,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-15 00:39:45,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,175 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-15 00:39:45,177 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-15 00:39:45,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-15 00:39:45,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,195 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,206 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-15 00:39:45,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,207 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-15 00:39:45,208 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-15 00:39:45,209 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-15 00:39:45,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,223 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,234 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-15 00:39:45,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,235 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-15 00:39:45,237 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-15 00:39:45,237 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-15 00:39:45,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,249 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,252 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-15 00:39:45,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,266 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-15 00:39:45,267 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-15 00:39:45,268 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-15 00:39:45,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,298 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-15 00:39:45,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,300 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-15 00:39:45,301 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-15 00:39:45,302 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-15 00:39:45,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,316 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,328 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-15 00:39:45,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,330 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-15 00:39:45,331 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-15 00:39:45,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:39:45,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-15 00:39:45,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,363 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-15 00:39:45,365 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-15 00:39:45,366 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-15 00:39:45,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-10-15 00:39:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,393 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-15 00:39:45,394 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-15 00:39:45,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-15 00:39:45,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,432 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-15 00:39:45,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,435 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-15 00:39:45,436 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-15 00:39:45,437 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-15 00:39:45,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,455 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-15 00:39:45,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,470 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-15 00:39:45,472 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-15 00:39:45,472 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-15 00:39:45,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,504 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-15 00:39:45,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,507 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-15 00:39:45,508 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-15 00:39:45,509 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-15 00:39:45,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,527 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-10-15 00:39:45,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,545 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-15 00:39:45,547 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-15 00:39:45,548 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-15 00:39:45,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:39:45,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:39:45,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:39:45,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,572 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-15 00:39:45,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,574 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-15 00:39:45,575 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-15 00:39:45,575 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-15 00:39:45,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-10-15 00:39:45,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,602 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-15 00:39:45,603 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-15 00:39:45,604 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-15 00:39:45,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:39:45,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:39:45,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:39:45,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-15 00:39:45,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,628 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-15 00:39:45,632 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-15 00:39:45,633 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-15 00:39:45,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-10-15 00:39:45,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,662 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-15 00:39:45,663 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-15 00:39:45,664 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-15 00:39:45,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,675 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,675 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,678 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-10-15 00:39:45,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,690 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-15 00:39:45,691 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-15 00:39:45,692 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-15 00:39:45,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,707 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,722 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-15 00:39:45,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,724 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-15 00:39:45,725 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-15 00:39:45,727 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-15 00:39:45,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-15 00:39:45,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,765 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-15 00:39:45,766 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-15 00:39:45,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-15 00:39:45,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:39:45,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:39:45,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:39:45,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,792 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-15 00:39:45,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,794 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-15 00:39:45,794 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-15 00:39:45,795 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-15 00:39:45,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,810 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-15 00:39:45,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,827 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-15 00:39:45,831 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-15 00:39:45,832 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-15 00:39:45,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,849 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-15 00:39:45,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,861 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-15 00:39:45,862 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-15 00:39:45,863 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-15 00:39:45,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-10-15 00:39:45,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,896 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-15 00:39:45,897 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-15 00:39:45,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-15 00:39:45,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:39:45,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:39:45,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:39:45,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-10-15 00:39:45,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,931 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-15 00:39:45,933 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-15 00:39:45,934 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-15 00:39:45,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:45,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:45,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-10-15 00:39:45,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,970 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-15 00:39:45,971 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-15 00:39:45,972 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-15 00:39:45,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:45,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:39:45,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:45,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:45,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:45,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:39:45,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:39:45,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:45,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-10-15 00:39:45,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:45,996 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-15 00:39:45,996 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-15 00:39:45,997 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-15 00:39:46,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:46,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:39:46,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:46,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:46,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:46,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:39:46,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:39:46,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:46,019 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-15 00:39:46,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:46,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:46,021 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-15 00:39:46,022 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-15 00:39:46,023 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-15 00:39:46,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:46,033 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-10-15 00:39:46,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:46,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:46,035 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-10-15 00:39:46,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:46,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:46,050 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-15 00:39:46,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:46,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:46,052 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-15 00:39:46,052 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-15 00:39:46,053 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-15 00:39:46,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:46,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:46,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:46,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:46,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:46,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:46,067 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:46,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-15 00:39:46,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:46,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:46,079 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-15 00:39:46,081 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-15 00:39:46,081 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-15 00:39:46,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:46,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:46,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:46,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:46,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:46,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:46,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:46,105 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-15 00:39:46,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:46,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:46,107 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-15 00:39:46,109 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-15 00:39:46,109 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-15 00:39:46,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:46,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:46,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:46,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:46,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:46,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:46,123 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:46,138 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-15 00:39:46,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:46,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:46,142 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-15 00:39:46,144 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-15 00:39:46,144 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-15 00:39:46,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:46,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-15 00:39:46,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:46,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:46,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:46,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-15 00:39:46,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-15 00:39:46,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:46,169 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-15 00:39:46,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:46,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:46,171 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-15 00:39:46,172 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-15 00:39:46,172 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-15 00:39:46,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:46,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:46,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:46,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:46,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:46,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:46,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-15 00:39:46,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-15 00:39:46,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:46,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:46,199 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-15 00:39:46,200 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-15 00:39:46,201 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-15 00:39:46,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-15 00:39:46,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-15 00:39:46,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-15 00:39:46,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-15 00:39:46,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-15 00:39:46,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-15 00:39:46,229 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-15 00:39:46,257 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-10-15 00:39:46,258 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-10-15 00:39:46,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-15 00:39:46,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-15 00:39:46,259 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-15 00:39:46,260 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-15 00:39:46,260 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-15 00:39:46,271 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-15 00:39:46,272 INFO L474 LassoAnalysis]: Proved termination. [2024-10-15 00:39:46,272 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-15 00:39:46,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2024-10-15 00:39:46,298 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-15 00:39:46,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:39:46,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-15 00:39:46,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:39:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:39:46,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 00:39:46,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 00:39:46,429 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-15 00:39:46,430 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-15 00:39:46,430 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-15 00:39:46,455 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-15 00:39:46,456 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-15 00:39:46,457 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-15 00:39:46,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2024-10-15 00:39:46,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 27 letters. Loop has 5 letters. [2024-10-15 00:39:46,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:39:46,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 32 letters. Loop has 5 letters. [2024-10-15 00:39:46,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:39:46,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 27 letters. Loop has 10 letters. [2024-10-15 00:39:46,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-15 00:39:46,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-10-15 00:39:46,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:39:46,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 52 transitions. [2024-10-15 00:39:46,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-15 00:39:46,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-15 00:39:46,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 52 transitions. [2024-10-15 00:39:46,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:39:46,461 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-15 00:39:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 52 transitions. [2024-10-15 00:39:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-15 00:39:46,464 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-15 00:39:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-10-15 00:39:46,465 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-15 00:39:46,465 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-15 00:39:46,465 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-15 00:39:46,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 52 transitions. [2024-10-15 00:39:46,466 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:39:46,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:39:46,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:39:46,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:39:46,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:39:46,467 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-15 00:39:46,467 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-15 00:39:46,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:46,469 INFO L85 PathProgramCache]: Analyzing trace with hash 999709617, now seen corresponding path program 1 times [2024-10-15 00:39:46,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:46,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062929110] [2024-10-15 00:39:46,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:46,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:39:46,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-15 00:39:46,622 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-15 00:39:46,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:39:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062929110] [2024-10-15 00:39:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062929110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:39:46,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:39:46,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:39:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511517507] [2024-10-15 00:39:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:39:46,624 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:39:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2024-10-15 00:39:46,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240666302] [2024-10-15 00:39:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:46,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:39:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:46,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:39:46,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:39:46,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:39:46,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:39:46,673 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-15 00:39:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:39:46,701 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-10-15 00:39:46,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 61 transitions. [2024-10-15 00:39:46,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:39:46,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 61 transitions. [2024-10-15 00:39:46,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-15 00:39:46,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-10-15 00:39:46,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 61 transitions. [2024-10-15 00:39:46,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:39:46,703 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-10-15 00:39:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 61 transitions. [2024-10-15 00:39:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-10-15 00:39:46,705 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-15 00:39:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-15 00:39:46,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-15 00:39:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:39:46,707 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-15 00:39:46,707 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-15 00:39:46,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2024-10-15 00:39:46,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:39:46,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:39:46,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:39:46,709 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 00:39:46,709 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:39:46,709 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-15 00:39:46,710 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-15 00:39:46,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1350299059, now seen corresponding path program 1 times [2024-10-15 00:39:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357867981] [2024-10-15 00:39:46,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:46,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:39:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:46,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:39:46,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:46,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2024-10-15 00:39:46,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:46,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277961004] [2024-10-15 00:39:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:46,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:39:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:46,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:39:46,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash -557270321, now seen corresponding path program 1 times [2024-10-15 00:39:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:46,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709594039] [2024-10-15 00:39:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:39:46,895 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-15 00:39:46,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:39:46,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709594039] [2024-10-15 00:39:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709594039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:39:46,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:39:46,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:39:46,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441266447] [2024-10-15 00:39:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:39:46,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:39:46,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:39:46,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:39:46,982 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-15 00:39:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:39:47,002 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-10-15 00:39:47,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2024-10-15 00:39:47,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:39:47,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 62 transitions. [2024-10-15 00:39:47,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-15 00:39:47,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-15 00:39:47,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 62 transitions. [2024-10-15 00:39:47,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:39:47,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-10-15 00:39:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 62 transitions. [2024-10-15 00:39:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-10-15 00:39:47,009 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-15 00:39:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-10-15 00:39:47,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-15 00:39:47,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:39:47,012 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-10-15 00:39:47,012 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-15 00:39:47,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 57 transitions. [2024-10-15 00:39:47,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:39:47,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:39:47,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:39:47,013 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-15 00:39:47,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:39:47,013 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-15 00:39:47,014 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-15 00:39:47,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:47,014 INFO L85 PathProgramCache]: Analyzing trace with hash -93871603, now seen corresponding path program 1 times [2024-10-15 00:39:47,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:47,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876663332] [2024-10-15 00:39:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 00:39:47,132 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-15 00:39:47,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 00:39:47,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876663332] [2024-10-15 00:39:47,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876663332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 00:39:47,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 00:39:47,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-15 00:39:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242316334] [2024-10-15 00:39:47,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 00:39:47,134 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-15 00:39:47,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 2 times [2024-10-15 00:39:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:47,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409047361] [2024-10-15 00:39:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:47,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:39:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:47,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:39:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 00:39:47,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-15 00:39:47,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-15 00:39:47,185 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-15 00:39:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 00:39:47,209 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2024-10-15 00:39:47,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 62 transitions. [2024-10-15 00:39:47,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:39:47,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 53 states and 60 transitions. [2024-10-15 00:39:47,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-15 00:39:47,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-15 00:39:47,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 60 transitions. [2024-10-15 00:39:47,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-15 00:39:47,211 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-10-15 00:39:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 60 transitions. [2024-10-15 00:39:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-10-15 00:39:47,216 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-15 00:39:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-10-15 00:39:47,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-10-15 00:39:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-15 00:39:47,221 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-10-15 00:39:47,221 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-15 00:39:47,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2024-10-15 00:39:47,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-10-15 00:39:47,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-15 00:39:47,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-15 00:39:47,222 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-15 00:39:47,222 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-15 00:39:47,223 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-15 00:39:47,223 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-15 00:39:47,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:47,224 INFO L85 PathProgramCache]: Analyzing trace with hash -95512495, now seen corresponding path program 1 times [2024-10-15 00:39:47,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:47,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666115005] [2024-10-15 00:39:47,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:47,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:47,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:39:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:47,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:39:47,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 3 times [2024-10-15 00:39:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:47,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338922410] [2024-10-15 00:39:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:47,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:47,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:39:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:47,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-15 00:39:47,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 00:39:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1593191981, now seen corresponding path program 1 times [2024-10-15 00:39:47,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 00:39:47,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519091896] [2024-10-15 00:39:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 00:39:47,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 00:39:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:47,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-15 00:39:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-15 00:39:47,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace