./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/array-memsafety/lis-alloca-1.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 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:25:36,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:25:36,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:25:36,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:25:36,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:25:36,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:25:36,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:25:36,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:25:36,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:25:36,275 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:25:36,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:25:36,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:25:36,276 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:25:36,276 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:25:36,276 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:25:36,277 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:25:36,277 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:25:36,277 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:25:36,278 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:25:36,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:25:36,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:25:36,279 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:25:36,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:25:36,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:25:36,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:25:36,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:25:36,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:25:36,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:25:36,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:25:36,281 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:25:36,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:25:36,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:25:36,281 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:25:36,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:25:36,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:25:36,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:25:36,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:25:36,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:25:36,283 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:25:36,283 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2024-11-19 14:25:36,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:25:36,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:25:36,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:25:36,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:25:36,475 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:25:36,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2024-11-19 14:25:37,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:25:38,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:25:38,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2024-11-19 14:25:38,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07f332c4/14b78c8189af40fd8ebf5f5e83e2ca9b/FLAG5162ff708 [2024-11-19 14:25:38,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07f332c4/14b78c8189af40fd8ebf5f5e83e2ca9b [2024-11-19 14:25:38,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:25:38,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:25:38,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:25:38,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:25:38,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:25:38,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72fba78e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38, skipping insertion in model container [2024-11-19 14:25:38,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:25:38,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:25:38,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:25:38,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:25:38,447 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:25:38,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38 WrapperNode [2024-11-19 14:25:38,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:25:38,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:25:38,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:25:38,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:25:38,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,487 INFO L138 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2024-11-19 14:25:38,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:25:38,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:25:38,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:25:38,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:25:38,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,510 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [7, 2, 3]. 58 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0, 0]. The 5 writes are split as follows [2, 2, 1]. [2024-11-19 14:25:38,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:25:38,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:25:38,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:25:38,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:25:38,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (1/1) ... [2024-11-19 14:25:38,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:38,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:38,569 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-11-19 14:25:38,572 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-11-19 14:25:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 14:25:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 14:25:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 14:25:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 14:25:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 14:25:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 14:25:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 14:25:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 14:25:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:25:38,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:25:38,792 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:25:38,798 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:25:38,924 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-19 14:25:38,924 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:25:38,934 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:25:38,935 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 14:25:38,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:25:38 BoogieIcfgContainer [2024-11-19 14:25:38,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:25:38,936 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:25:38,936 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:25:38,939 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:25:38,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:25:38,939 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:25:38" (1/3) ... [2024-11-19 14:25:38,940 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@132a1a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:25:38, skipping insertion in model container [2024-11-19 14:25:38,940 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:25:38,940 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:25:38" (2/3) ... [2024-11-19 14:25:38,940 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@132a1a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:25:38, skipping insertion in model container [2024-11-19 14:25:38,941 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:25:38,941 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:25:38" (3/3) ... [2024-11-19 14:25:38,941 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2024-11-19 14:25:38,986 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:25:38,986 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:25:38,986 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:25:38,986 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:25:38,986 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:25:38,987 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:25:38,987 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:25:38,987 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:25:38,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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-11-19 14:25:39,007 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2024-11-19 14:25:39,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:39,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:39,013 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:25:39,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:39,013 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:25:39,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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-11-19 14:25:39,017 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2024-11-19 14:25:39,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:39,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:39,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-19 14:25:39,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:39,025 INFO L745 eck$LassoCheckResult]: Stem: 23#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 11#L530true assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6#L530-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3#L535-3true [2024-11-19 14:25:39,026 INFO L747 eck$LassoCheckResult]: Loop: 3#L535-3true assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 15#L535-2true main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3#L535-3true [2024-11-19 14:25:39,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-19 14:25:39,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:39,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783439424] [2024-11-19 14:25:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:39,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:39,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:39,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:39,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2024-11-19 14:25:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:39,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059703767] [2024-11-19 14:25:39,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:39,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:39,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:39,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:39,185 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2024-11-19 14:25:39,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:39,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940311601] [2024-11-19 14:25:39,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:39,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:39,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:39,454 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:25:39,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:25:39,454 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:25:39,454 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:25:39,455 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:25:39,455 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:39,455 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:25:39,455 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:25:39,455 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2024-11-19 14:25:39,455 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:25:39,455 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:25:39,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:39,791 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:25:39,794 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:25:39,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:39,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:39,802 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-11-19 14:25:39,814 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-11-19 14:25:39,815 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-11-19 14:25:39,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:39,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:39,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:39,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:39,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:39,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:39,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:39,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:39,848 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-11-19 14:25:39,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:39,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:39,850 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-11-19 14:25:39,855 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-11-19 14:25:39,856 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-11-19 14:25:39,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:39,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:39,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:39,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:39,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:39,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:39,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:39,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:39,880 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-11-19 14:25:39,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:39,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:39,882 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-11-19 14:25:39,884 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-11-19 14:25:39,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:25:39,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:39,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:39,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:39,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:39,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:39,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:39,902 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:39,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:39,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:39,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:39,915 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-11-19 14:25:39,917 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-11-19 14:25:39,921 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-11-19 14:25:39,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:39,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:39,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:39,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:39,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:39,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:39,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:39,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:39,945 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-11-19 14:25:39,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:39,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:39,947 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-11-19 14:25:39,948 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-11-19 14:25:39,951 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-11-19 14:25:39,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:39,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:39,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:39,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:39,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:39,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:39,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:39,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:39,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:39,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:39,979 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-11-19 14:25:39,980 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-11-19 14:25:39,982 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-11-19 14:25:39,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:39,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:39,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:39,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:39,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:39,995 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:40,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:40,013 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-11-19 14:25:40,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:40,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:40,016 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-11-19 14:25:40,017 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-11-19 14:25:40,018 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-11-19 14:25:40,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:40,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:40,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:40,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:40,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:40,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:40,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:40,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-19 14:25:40,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:40,058 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-11-19 14:25:40,059 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-11-19 14:25:40,061 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-11-19 14:25:40,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:40,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:40,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:40,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:40,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:40,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:40,087 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:25:40,106 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-19 14:25:40,106 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-19 14:25:40,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:40,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:40,109 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-11-19 14:25:40,114 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-11-19 14:25:40,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:25:40,129 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:25:40,129 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:25:40,130 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~array_size~0#1, ULTIMATE.start_main_~i~1#1) = 1*ULTIMATE.start_main_~array_size~0#1 - 1*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-11-19 14:25:40,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:40,149 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-19 14:25:40,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:40,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:25:40,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:40,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:25:40,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:25:40,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:40,276 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-11-19 14:25:40,278 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-19 14:25:40,315 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 72 transitions. Complement of second has 6 states. [2024-11-19 14:25:40,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-19 14:25:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-19 14:25:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2024-11-19 14:25:40,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-19 14:25:40,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:40,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 6 letters. Loop has 2 letters. [2024-11-19 14:25:40,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:40,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 4 letters. Loop has 4 letters. [2024-11-19 14:25:40,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:40,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 72 transitions. [2024-11-19 14:25:40,328 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-19 14:25:40,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 21 states and 33 transitions. [2024-11-19 14:25:40,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-19 14:25:40,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-19 14:25:40,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2024-11-19 14:25:40,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:40,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 33 transitions. [2024-11-19 14:25:40,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2024-11-19 14:25:40,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-19 14:25:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 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-11-19 14:25:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2024-11-19 14:25:40,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 33 transitions. [2024-11-19 14:25:40,354 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2024-11-19 14:25:40,354 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:25:40,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2024-11-19 14:25:40,354 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-19 14:25:40,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:40,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:40,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:25:40,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:40,356 INFO L745 eck$LassoCheckResult]: Stem: 144#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 136#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 137#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 132#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 125#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 127#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 139#L517-3 [2024-11-19 14:25:40,356 INFO L747 eck$LassoCheckResult]: Loop: 139#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 138#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 139#L517-3 [2024-11-19 14:25:40,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2024-11-19 14:25:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:40,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179322963] [2024-11-19 14:25:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:40,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:40,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:25:40,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:40,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179322963] [2024-11-19 14:25:40,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179322963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:25:40,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:25:40,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:25:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012551425] [2024-11-19 14:25:40,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:25:40,486 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:25:40,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2024-11-19 14:25:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094500925] [2024-11-19 14:25:40,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:40,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:40,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:40,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:40,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:25:40,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:25:40,593 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-11-19 14:25:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:40,612 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2024-11-19 14:25:40,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2024-11-19 14:25:40,614 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-19 14:25:40,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2024-11-19 14:25:40,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-19 14:25:40,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-19 14:25:40,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2024-11-19 14:25:40,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:40,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-19 14:25:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2024-11-19 14:25:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-19 14:25:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-11-19 14:25:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2024-11-19 14:25:40,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 29 transitions. [2024-11-19 14:25:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:25:40,619 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2024-11-19 14:25:40,619 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:25:40,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2024-11-19 14:25:40,620 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-19 14:25:40,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:40,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:40,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:40,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-19 14:25:40,621 INFO L745 eck$LassoCheckResult]: Stem: 194#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 187#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 182#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 175#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 176#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 177#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 178#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 189#L517-3 [2024-11-19 14:25:40,621 INFO L747 eck$LassoCheckResult]: Loop: 189#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 188#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 189#L517-3 [2024-11-19 14:25:40,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:40,622 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2024-11-19 14:25:40,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:40,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266831022] [2024-11-19 14:25:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:40,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:40,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:40,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:40,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2024-11-19 14:25:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:40,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021689722] [2024-11-19 14:25:40,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:40,653 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:25:40,653 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:40,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:40,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:40,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2024-11-19 14:25:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:40,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320569292] [2024-11-19 14:25:40,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:40,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:40,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:40,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:41,087 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:25:41,087 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:25:41,087 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:25:41,087 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:25:41,088 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:25:41,088 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,088 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:25:41,088 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:25:41,088 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2024-11-19 14:25:41,088 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:25:41,088 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:25:41,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,341 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:41,594 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:25:41,594 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:25:41,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,596 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-11-19 14:25:41,597 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-11-19 14:25:41,598 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-11-19 14:25:41,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:41,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:41,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:41,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,628 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-11-19 14:25:41,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,629 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-11-19 14:25:41,630 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-11-19 14:25:41,631 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-11-19 14:25:41,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:41,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:41,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:41,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-19 14:25:41,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,662 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-11-19 14:25:41,663 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-11-19 14:25:41,663 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-11-19 14:25:41,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,674 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:41,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:41,677 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,687 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-11-19 14:25:41,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,689 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-11-19 14:25:41,690 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-11-19 14:25:41,691 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-11-19 14:25:41,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:41,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:41,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:41,705 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,718 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-11-19 14:25:41,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,720 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-11-19 14:25:41,721 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-11-19 14:25:41,722 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-11-19 14:25:41,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:41,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:41,733 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:41,734 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:41,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,746 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-11-19 14:25:41,748 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-11-19 14:25:41,748 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-11-19 14:25:41,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:41,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:41,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:41,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:41,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,772 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-11-19 14:25:41,773 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-11-19 14:25:41,773 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:25:41,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:41,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:41,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:41,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,795 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-11-19 14:25:41,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,797 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-11-19 14:25:41,799 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-11-19 14:25:41,799 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-11-19 14:25:41,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:41,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:41,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-19 14:25:41,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,835 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-11-19 14:25:41,838 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-11-19 14:25:41,839 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-11-19 14:25:41,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:41,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:41,856 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,867 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-11-19 14:25:41,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,869 INFO L229 MonitoredProcess]: Starting monitored process 20 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-11-19 14:25:41,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-19 14:25:41,872 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-11-19 14:25:41,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:41,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:41,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:41,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:41,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,895 INFO L229 MonitoredProcess]: Starting monitored process 21 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-11-19 14:25:41,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-11-19 14:25:41,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:25:41,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:41,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:41,914 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:41,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,926 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-11-19 14:25:41,929 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-11-19 14:25:41,929 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-11-19 14:25:41,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:41,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:41,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:41,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,955 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-11-19 14:25:41,956 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-11-19 14:25:41,957 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-11-19 14:25:41,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,969 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:41,969 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:41,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:41,983 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-11-19 14:25:41,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:41,985 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-11-19 14:25:41,985 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-11-19 14:25:41,986 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-11-19 14:25:41,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:41,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:41,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:41,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:41,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:41,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:41,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:42,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:42,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:42,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,013 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-11-19 14:25:42,014 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-11-19 14:25:42,019 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-11-19 14:25:42,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:42,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:42,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:42,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:42,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:42,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:42,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:42,045 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-11-19 14:25:42,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,047 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-11-19 14:25:42,048 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-11-19 14:25:42,048 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-11-19 14:25:42,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:42,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:42,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:42,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:42,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:42,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:42,073 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:25:42,094 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-19 14:25:42,094 INFO L444 ModelExtractionUtils]: 2 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2024-11-19 14:25:42,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,095 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-11-19 14:25:42,100 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-11-19 14:25:42,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:25:42,112 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:25:42,112 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:25:42,112 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_lis_~prev~0#1.base)_1, ULTIMATE.start_lis_~prev~0#1.offset, ULTIMATE.start_lis_~i~0#1) = 2*v_rep(select #length ULTIMATE.start_lis_~prev~0#1.base)_1 - 1*ULTIMATE.start_lis_~prev~0#1.offset - 4*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2024-11-19 14:25:42,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:42,150 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2024-11-19 14:25:42,151 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~prev~0!offset [2024-11-19 14:25:42,152 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-19 14:25:42,152 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-19 14:25:42,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:42,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:25:42,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:42,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:25:42,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:25:42,203 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-11-19 14:25:42,203 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-19 14:25:42,216 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 29 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 33 transitions. Complement of second has 5 states. [2024-11-19 14:25:42,217 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-11-19 14:25:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-19 14:25:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-19 14:25:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2024-11-19 14:25:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2024-11-19 14:25:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 8 letters. Loop has 4 letters. [2024-11-19 14:25:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:42,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 33 transitions. [2024-11-19 14:25:42,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:25:42,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 22 states and 31 transitions. [2024-11-19 14:25:42,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-11-19 14:25:42,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-11-19 14:25:42,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2024-11-19 14:25:42,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:42,219 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-19 14:25:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2024-11-19 14:25:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-19 14:25:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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-11-19 14:25:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2024-11-19 14:25:42,220 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-19 14:25:42,220 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2024-11-19 14:25:42,220 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:25:42,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2024-11-19 14:25:42,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-19 14:25:42,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:42,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:42,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:42,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:25:42,222 INFO L745 eck$LassoCheckResult]: Stem: 349#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 340#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 341#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 336#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 329#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 330#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 331#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 332#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 348#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 350#L517-4 lis_~i~0#1 := 1; 339#L519-3 [2024-11-19 14:25:42,222 INFO L747 eck$LassoCheckResult]: Loop: 339#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 333#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 334#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 339#L519-3 [2024-11-19 14:25:42,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2024-11-19 14:25:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990486673] [2024-11-19 14:25:42,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:42,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:25:42,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:42,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990486673] [2024-11-19 14:25:42,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990486673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:25:42,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:25:42,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 14:25:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617697068] [2024-11-19 14:25:42,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:25:42,314 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:25:42,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2024-11-19 14:25:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:42,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800262761] [2024-11-19 14:25:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:42,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:42,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:42,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:42,341 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:25:42,341 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:25:42,341 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:25:42,341 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:25:42,341 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-19 14:25:42,341 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,341 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:25:42,341 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:25:42,342 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2024-11-19 14:25:42,342 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:25:42,342 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:25:42,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,405 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:25:42,406 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-19 14:25:42,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,413 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-11-19 14:25:42,414 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-11-19 14:25:42,415 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:25:42,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:25:42,434 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:25:42,435 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PID_3=1} Honda state: {v_rep~unnamed0~0~P_PID_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:25:42,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-19 14:25:42,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,447 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-11-19 14:25:42,448 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-11-19 14:25:42,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:25:42,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:25:42,466 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-19 14:25:42,466 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~P_PGID_3=2} Honda state: {v_rep~unnamed0~0~P_PGID_3=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-11-19 14:25:42,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:42,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,478 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-11-19 14:25:42,479 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-11-19 14:25:42,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-19 14:25:42,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:25:42,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:42,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,504 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-11-19 14:25:42,505 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-11-19 14:25:42,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-19 14:25:42,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-19 14:25:42,533 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-19 14:25:42,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:42,539 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:25:42,539 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:25:42,540 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:25:42,540 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:25:42,540 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:25:42,540 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,540 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:25:42,540 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:25:42,540 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2024-11-19 14:25:42,540 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:25:42,540 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:25:42,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:42,590 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:25:42,590 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:25:42,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,591 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-11-19 14:25:42,594 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-11-19 14:25:42,594 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-11-19 14:25:42,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:42,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:42,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:42,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:42,605 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:42,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:42,608 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:42,618 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-11-19 14:25:42,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,621 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-11-19 14:25:42,621 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-11-19 14:25:42,622 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-11-19 14:25:42,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:42,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:42,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:42,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:42,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:42,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:42,635 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:42,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:42,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,646 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-11-19 14:25:42,647 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-11-19 14:25:42,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:25:42,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:42,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:42,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:42,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:42,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:42,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:42,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:42,661 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:25:42,663 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-19 14:25:42,663 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-19 14:25:42,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:42,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,664 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-11-19 14:25:42,665 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-11-19 14:25:42,669 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:25:42,669 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-19 14:25:42,669 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:25:42,669 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2024-11-19 14:25:42,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:42,680 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-19 14:25:42,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:42,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2024-11-19 14:25:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:42,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:25:42,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:42,745 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-11-19 14:25:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:42,748 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:25:42,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:25:42,772 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-19 14:25:42,773 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-19 14:25:42,810 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 42 states and 64 transitions. Complement of second has 9 states. [2024-11-19 14:25:42,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 14:25:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-19 14:25:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2024-11-19 14:25:42,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 3 letters. [2024-11-19 14:25:42,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:42,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 13 letters. Loop has 3 letters. [2024-11-19 14:25:42,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:42,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 10 letters. Loop has 6 letters. [2024-11-19 14:25:42,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:42,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 64 transitions. [2024-11-19 14:25:42,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2024-11-19 14:25:42,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 62 transitions. [2024-11-19 14:25:42,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-19 14:25:42,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-19 14:25:42,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2024-11-19 14:25:42,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:25:42,814 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2024-11-19 14:25:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2024-11-19 14:25:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-11-19 14:25:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:25:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2024-11-19 14:25:42,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 50 transitions. [2024-11-19 14:25:42,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:42,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:25:42,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:25:42,817 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-19 14:25:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:42,844 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2024-11-19 14:25:42,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2024-11-19 14:25:42,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-19 14:25:42,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2024-11-19 14:25:42,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-19 14:25:42,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-19 14:25:42,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2024-11-19 14:25:42,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:25:42,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2024-11-19 14:25:42,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2024-11-19 14:25:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-19 14:25:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 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-11-19 14:25:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2024-11-19 14:25:42,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 49 transitions. [2024-11-19 14:25:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:25:42,848 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2024-11-19 14:25:42,848 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:25:42,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2024-11-19 14:25:42,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-19 14:25:42,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:42,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:42,850 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:42,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:42,850 INFO L745 eck$LassoCheckResult]: Stem: 554#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 544#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 535#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 526#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 527#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 528#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 529#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 553#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 545#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 546#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 555#L517-4 lis_~i~0#1 := 1; 556#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 530#L520-3 [2024-11-19 14:25:42,850 INFO L747 eck$LassoCheckResult]: Loop: 530#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 531#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 536#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 537#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 549#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 540#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 541#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 530#L520-3 [2024-11-19 14:25:42,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2024-11-19 14:25:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:42,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466045310] [2024-11-19 14:25:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:25:42,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:42,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466045310] [2024-11-19 14:25:42,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466045310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:25:42,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115109132] [2024-11-19 14:25:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:42,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:25:42,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:42,958 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:25:42,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-19 14:25:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:43,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 14:25:43,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:25:43,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:25:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:25:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115109132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:25:43,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:25:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2024-11-19 14:25:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945634252] [2024-11-19 14:25:43,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:25:43,072 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:25:43,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2024-11-19 14:25:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:43,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774254863] [2024-11-19 14:25:43,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:43,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:43,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:43,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:43,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:43,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 14:25:43,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 14:25:43,231 INFO L87 Difference]: Start difference. First operand 33 states and 49 transitions. cyclomatic complexity: 21 Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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-11-19 14:25:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:43,308 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2024-11-19 14:25:43,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 71 transitions. [2024-11-19 14:25:43,309 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 14:25:43,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 71 transitions. [2024-11-19 14:25:43,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-19 14:25:43,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-19 14:25:43,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 71 transitions. [2024-11-19 14:25:43,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:25:43,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-19 14:25:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 71 transitions. [2024-11-19 14:25:43,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-11-19 14:25:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 44 states have internal predecessors, (64), 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-11-19 14:25:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-11-19 14:25:43,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-19 14:25:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:25:43,313 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-19 14:25:43,313 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:25:43,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. [2024-11-19 14:25:43,314 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2024-11-19 14:25:43,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:43,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:43,315 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:43,315 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:25:43,315 INFO L745 eck$LassoCheckResult]: Stem: 733#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 720#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 721#L530 assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1; 724#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 701#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 702#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 743#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 742#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 741#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 740#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 739#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 738#L517-4 lis_~i~0#1 := 1; 725#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 726#L519-4 lis_~i~0#1 := 0; 729#L523-3 [2024-11-19 14:25:43,315 INFO L747 eck$LassoCheckResult]: Loop: 729#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem13#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 730#L524 assume lis_~max~0#1 < lis_#t~mem13#1;havoc lis_#t~mem13#1;call lis_#t~mem14#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem14#1; 731#L523-2 lis_#t~post15#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post15#1;havoc lis_#t~post15#1; 729#L523-3 [2024-11-19 14:25:43,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash -520179462, now seen corresponding path program 1 times [2024-11-19 14:25:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:43,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389833668] [2024-11-19 14:25:43,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:43,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:43,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:43,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2024-11-19 14:25:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:43,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529322180] [2024-11-19 14:25:43,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:43,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:43,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash -424266948, now seen corresponding path program 1 times [2024-11-19 14:25:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290743730] [2024-11-19 14:25:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:43,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:43,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:44,226 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:25:44,226 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:25:44,226 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:25:44,226 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:25:44,226 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:25:44,226 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:44,226 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:25:44,226 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:25:44,226 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration6_Lasso [2024-11-19 14:25:44,227 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:25:44,227 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:25:44,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,523 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:25:44,855 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:25:44,855 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:25:44,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:44,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:44,856 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-11-19 14:25:44,865 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-11-19 14:25:44,866 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-11-19 14:25:44,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:44,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:44,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:44,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:44,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:44,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:44,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:44,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:44,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:44,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:44,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:44,890 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-11-19 14:25:44,891 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-11-19 14:25:44,892 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-11-19 14:25:44,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:44,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:44,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:44,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:44,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:44,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:44,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:44,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:44,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-19 14:25:44,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:44,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:44,916 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-11-19 14:25:44,917 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-11-19 14:25:44,918 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-11-19 14:25:44,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:44,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:44,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:44,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:44,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:44,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:44,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:44,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:44,939 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-11-19 14:25:44,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:44,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:44,941 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-11-19 14:25:44,942 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-11-19 14:25:44,943 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-11-19 14:25:44,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:44,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:44,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:44,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:44,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:44,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:44,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:44,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:44,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:44,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:44,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:44,967 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-11-19 14:25:44,968 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-11-19 14:25:44,968 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-11-19 14:25:44,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:44,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:44,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:44,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:44,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:44,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:44,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:44,993 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-11-19 14:25:44,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:44,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:44,994 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-11-19 14:25:44,995 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-11-19 14:25:44,996 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-11-19 14:25:45,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:45,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:45,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:45,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,018 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-11-19 14:25:45,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,020 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-11-19 14:25:45,021 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-11-19 14:25:45,021 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-11-19 14:25:45,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:45,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:45,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:45,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:45,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,045 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-11-19 14:25:45,048 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-11-19 14:25:45,048 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-11-19 14:25:45,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:45,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:45,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:45,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:45,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,072 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-11-19 14:25:45,073 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-11-19 14:25:45,073 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-11-19 14:25:45,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:45,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:45,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:45,084 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,095 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-11-19 14:25:45,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,096 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-11-19 14:25:45,097 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-11-19 14:25:45,098 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-11-19 14:25:45,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:45,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:45,116 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,128 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-11-19 14:25:45,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,130 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-11-19 14:25:45,132 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-11-19 14:25:45,134 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-11-19 14:25:45,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:45,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:45,162 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,180 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-11-19 14:25:45,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,182 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-11-19 14:25:45,185 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-11-19 14:25:45,185 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-11-19 14:25:45,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:45,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:45,214 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:45,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,226 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-11-19 14:25:45,227 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-11-19 14:25:45,228 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-11-19 14:25:45,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:45,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:45,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:45,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,259 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-11-19 14:25:45,259 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-11-19 14:25:45,260 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-11-19 14:25:45,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:45,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:45,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:45,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,284 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-11-19 14:25:45,285 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-11-19 14:25:45,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:25:45,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:45,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:45,301 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:45,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,313 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-11-19 14:25:45,314 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-11-19 14:25:45,315 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-11-19 14:25:45,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:45,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:45,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,338 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-11-19 14:25:45,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,339 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-11-19 14:25:45,341 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-11-19 14:25:45,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:25:45,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:25:45,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:25:45,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:25:45,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:25:45,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-19 14:25:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,369 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-11-19 14:25:45,370 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-11-19 14:25:45,370 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-11-19 14:25:45,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:25:45,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:25:45,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:25:45,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:25:45,384 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:25:45,384 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:25:45,390 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:25:45,409 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-19 14:25:45,409 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-19 14:25:45,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:25:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,410 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-11-19 14:25:45,411 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-11-19 14:25:45,412 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:25:45,423 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 14:25:45,423 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:25:45,423 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1, ULTIMATE.start_lis_~N#1) = -1*ULTIMATE.start_lis_~i~0#1 + 1*ULTIMATE.start_lis_~N#1 Supporting invariants [] [2024-11-19 14:25:45,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-19 14:25:45,455 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2024-11-19 14:25:45,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:45,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 14:25:45,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:45,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:25:45,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:25:45,518 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-11-19 14:25:45,518 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-19 14:25:45,529 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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) Result 48 states and 69 transitions. Complement of second has 4 states. [2024-11-19 14:25:45,529 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-11-19 14:25:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-11-19 14:25:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2024-11-19 14:25:45,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2024-11-19 14:25:45,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:45,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 17 letters. Loop has 3 letters. [2024-11-19 14:25:45,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:45,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 14 letters. Loop has 6 letters. [2024-11-19 14:25:45,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:25:45,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 69 transitions. [2024-11-19 14:25:45,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:25:45,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 31 states and 42 transitions. [2024-11-19 14:25:45,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-19 14:25:45,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2024-11-19 14:25:45,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2024-11-19 14:25:45,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:25:45,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-19 14:25:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2024-11-19 14:25:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-19 14:25:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 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-11-19 14:25:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-11-19 14:25:45,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-19 14:25:45,533 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-11-19 14:25:45,533 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:25:45,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2024-11-19 14:25:45,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:25:45,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:45,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:45,533 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:45,533 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:45,533 INFO L745 eck$LassoCheckResult]: Stem: 931#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 922#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 923#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 913#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 904#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 905#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 906#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 907#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 921#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 929#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 930#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 924#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 925#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 932#L517-4 lis_~i~0#1 := 1; 933#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 908#L520-3 [2024-11-19 14:25:45,533 INFO L747 eck$LassoCheckResult]: Loop: 908#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 909#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 914#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 915#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 926#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 918#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 919#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 908#L520-3 [2024-11-19 14:25:45,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1166516274, now seen corresponding path program 2 times [2024-11-19 14:25:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:45,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362121676] [2024-11-19 14:25:45,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:45,556 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:25:45,557 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:25:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:25:45,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362121676] [2024-11-19 14:25:45,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362121676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:25:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876334055] [2024-11-19 14:25:45,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:45,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:25:45,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:45,622 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:25:45,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2024-11-19 14:25:45,684 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:25:45,684 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:25:45,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:25:45,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:25:45,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:25:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:25:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876334055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:25:45,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:25:45,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-19 14:25:45,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672014192] [2024-11-19 14:25:45,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:25:45,731 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:25:45,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2024-11-19 14:25:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:45,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973575940] [2024-11-19 14:25:45,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:45,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:45,740 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:25:45,740 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:45,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:45,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:45,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 14:25:45,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 14:25:45,876 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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-11-19 14:25:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:45,915 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2024-11-19 14:25:45,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 67 transitions. [2024-11-19 14:25:45,916 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:25:45,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 65 transitions. [2024-11-19 14:25:45,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 14:25:45,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-19 14:25:45,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 65 transitions. [2024-11-19 14:25:45,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:25:45,916 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 65 transitions. [2024-11-19 14:25:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 65 transitions. [2024-11-19 14:25:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2024-11-19 14:25:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 32 states have internal predecessors, (44), 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-11-19 14:25:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2024-11-19 14:25:45,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-19 14:25:45,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 14:25:45,919 INFO L425 stractBuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2024-11-19 14:25:45,919 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 14:25:45,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2024-11-19 14:25:45,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:25:45,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:45,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:45,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:45,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:45,919 INFO L745 eck$LassoCheckResult]: Stem: 1107#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1098#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1099#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1089#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1080#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 1081#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 1082#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 1083#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 1094#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1105#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1106#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1100#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1101#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1110#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1111#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1108#L517-4 lis_~i~0#1 := 1; 1109#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1084#L520-3 [2024-11-19 14:25:45,920 INFO L747 eck$LassoCheckResult]: Loop: 1084#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 1085#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 1090#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 1091#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1103#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1095#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 1096#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1084#L520-3 [2024-11-19 14:25:45,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 3 times [2024-11-19 14:25:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:45,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427820881] [2024-11-19 14:25:45,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:25:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:45,967 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-11-19 14:25:45,989 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 14:25:45,990 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:45,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:46,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:46,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:46,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 3 times [2024-11-19 14:25:46,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:46,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278087634] [2024-11-19 14:25:46,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:25:46,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:46,007 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 14:25:46,007 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:46,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:46,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:46,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2024-11-19 14:25:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:46,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630696924] [2024-11-19 14:25:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:25:46,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:46,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630696924] [2024-11-19 14:25:46,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630696924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:25:46,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204972130] [2024-11-19 14:25:46,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:46,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:25:46,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:46,130 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:25:46,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2024-11-19 14:25:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:46,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 14:25:46,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 14:25:46,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:25:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 14:25:46,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204972130] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:25:46,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:25:46,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 13 [2024-11-19 14:25:46,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623792989] [2024-11-19 14:25:46,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:25:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:46,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 14:25:46,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-19 14:25:46,430 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand has 14 states, 13 states have (on average 3.076923076923077) internal successors, (40), 14 states have internal predecessors, (40), 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-11-19 14:25:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:46,502 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2024-11-19 14:25:46,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 86 transitions. [2024-11-19 14:25:46,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:25:46,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 52 states and 69 transitions. [2024-11-19 14:25:46,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-19 14:25:46,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-19 14:25:46,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 69 transitions. [2024-11-19 14:25:46,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:25:46,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 69 transitions. [2024-11-19 14:25:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 69 transitions. [2024-11-19 14:25:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2024-11-19 14:25:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 46 states have internal predecessors, (62), 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-11-19 14:25:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2024-11-19 14:25:46,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-11-19 14:25:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:25:46,506 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-11-19 14:25:46,506 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 14:25:46,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2024-11-19 14:25:46,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:25:46,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:46,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:46,507 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:46,507 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:25:46,507 INFO L745 eck$LassoCheckResult]: Stem: 1361#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1354#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1345#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1336#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 1337#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 1338#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 1339#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 1382#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1378#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1377#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1376#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1375#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1374#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1373#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1372#L517-4 lis_~i~0#1 := 1; 1357#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1340#L520-3 [2024-11-19 14:25:46,507 INFO L747 eck$LassoCheckResult]: Loop: 1340#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 1341#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 1346#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 1347#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1340#L520-3 [2024-11-19 14:25:46,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 4 times [2024-11-19 14:25:46,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:46,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849292083] [2024-11-19 14:25:46,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:25:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:46,521 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:25:46,521 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:46,521 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:46,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:46,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2024-11-19 14:25:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:46,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269677945] [2024-11-19 14:25:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:46,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:46,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:46,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:46,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2024-11-19 14:25:46,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:46,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437792638] [2024-11-19 14:25:46,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:46,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:25:47,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:47,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437792638] [2024-11-19 14:25:47,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437792638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:25:47,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837781508] [2024-11-19 14:25:47,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:47,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:25:47,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:47,049 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:25:47,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2024-11-19 14:25:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:47,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:25:47,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:47,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 14:25:47,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 14:25:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:25:47,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:25:47,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2024-11-19 14:25:47,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 14:25:47,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 141 [2024-11-19 14:25:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 14:25:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837781508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:25:47,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:25:47,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 24 [2024-11-19 14:25:47,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842922792] [2024-11-19 14:25:47,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:25:47,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:47,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 14:25:47,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2024-11-19 14:25:47,463 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 21 Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 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-11-19 14:25:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:47,670 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2024-11-19 14:25:47,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 186 transitions. [2024-11-19 14:25:47,671 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 34 [2024-11-19 14:25:47,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 186 transitions. [2024-11-19 14:25:47,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2024-11-19 14:25:47,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2024-11-19 14:25:47,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 186 transitions. [2024-11-19 14:25:47,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:25:47,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 186 transitions. [2024-11-19 14:25:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 186 transitions. [2024-11-19 14:25:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 68. [2024-11-19 14:25:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 67 states have internal predecessors, (94), 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-11-19 14:25:47,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2024-11-19 14:25:47,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-11-19 14:25:47,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 14:25:47,677 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-11-19 14:25:47,677 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 14:25:47,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 94 transitions. [2024-11-19 14:25:47,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-19 14:25:47,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:47,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:47,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:47,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:25:47,679 INFO L745 eck$LassoCheckResult]: Stem: 1699#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1686#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1687#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1677#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1669#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 1670#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 1671#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 1672#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 1704#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1697#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1698#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1688#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1689#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1708#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1709#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1700#L517-4 lis_~i~0#1 := 1; 1701#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1727#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 1728#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 1678#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1679#L520-2 [2024-11-19 14:25:47,679 INFO L747 eck$LassoCheckResult]: Loop: 1679#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1692#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 1725#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 1724#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 1679#L520-2 [2024-11-19 14:25:47,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:47,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1451833899, now seen corresponding path program 1 times [2024-11-19 14:25:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950078056] [2024-11-19 14:25:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:47,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:47,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:47,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:47,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 2 times [2024-11-19 14:25:47,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:47,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197408933] [2024-11-19 14:25:47,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:47,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:47,716 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:25:47,716 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:47,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:47,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:47,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash 500759334, now seen corresponding path program 1 times [2024-11-19 14:25:47,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:47,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197319687] [2024-11-19 14:25:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:47,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 14:25:47,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:47,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197319687] [2024-11-19 14:25:47,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197319687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:25:47,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898270289] [2024-11-19 14:25:47,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:47,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:25:47,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:47,829 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:25:47,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2024-11-19 14:25:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:47,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 14:25:47,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-19 14:25:47,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 14:25:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898270289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:25:47,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 14:25:47,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2024-11-19 14:25:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575528489] [2024-11-19 14:25:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:25:48,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:48,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 14:25:48,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-19 14:25:48,064 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. cyclomatic complexity: 32 Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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-11-19 14:25:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:48,091 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2024-11-19 14:25:48,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 86 transitions. [2024-11-19 14:25:48,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:25:48,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 53 states and 68 transitions. [2024-11-19 14:25:48,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-11-19 14:25:48,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-11-19 14:25:48,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 68 transitions. [2024-11-19 14:25:48,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:25:48,093 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-11-19 14:25:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 68 transitions. [2024-11-19 14:25:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2024-11-19 14:25:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 46 states have internal predecessors, (62), 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-11-19 14:25:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2024-11-19 14:25:48,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-11-19 14:25:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 14:25:48,097 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2024-11-19 14:25:48,097 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 14:25:48,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2024-11-19 14:25:48,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:25:48,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:48,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:48,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:48,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:48,099 INFO L745 eck$LassoCheckResult]: Stem: 1916#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1904#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1905#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1896#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 1888#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 1889#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 1890#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 1891#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 1923#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 1921#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 1920#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1914#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1915#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1906#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1907#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1919#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1922#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1917#L517-4 lis_~i~0#1 := 1; 1918#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1928#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 1910#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 1897#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1898#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1909#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1901#L519-2 [2024-11-19 14:25:48,099 INFO L747 eck$LassoCheckResult]: Loop: 1901#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 1902#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1892#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 1893#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 1927#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 1926#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 1925#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1901#L519-2 [2024-11-19 14:25:48,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2024-11-19 14:25:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:48,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684357519] [2024-11-19 14:25:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:25:48,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684357519] [2024-11-19 14:25:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684357519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:25:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970482588] [2024-11-19 14:25:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:25:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:48,223 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:25:48,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2024-11-19 14:25:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:48,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:25:48,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:25:48,349 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:25:48,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:25:48,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970482588] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:25:48,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:25:48,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-19 14:25:48,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661095890] [2024-11-19 14:25:48,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:25:48,397 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:25:48,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 4 times [2024-11-19 14:25:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:48,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869625669] [2024-11-19 14:25:48,398 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:25:48,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:48,402 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:25:48,403 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:48,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:48,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 14:25:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 14:25:48,532 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 19 Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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-11-19 14:25:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:48,606 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-11-19 14:25:48,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2024-11-19 14:25:48,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:25:48,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 65 transitions. [2024-11-19 14:25:48,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 14:25:48,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-19 14:25:48,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 65 transitions. [2024-11-19 14:25:48,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:25:48,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 65 transitions. [2024-11-19 14:25:48,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 65 transitions. [2024-11-19 14:25:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-19 14:25:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 48 states have internal predecessors, (64), 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-11-19 14:25:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-11-19 14:25:48,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-19 14:25:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 14:25:48,614 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-19 14:25:48,614 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 14:25:48,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2024-11-19 14:25:48,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-11-19 14:25:48,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:48,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:48,615 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:48,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:48,615 INFO L745 eck$LassoCheckResult]: Stem: 2173#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2160#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2150#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2142#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 2143#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 2144#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 2145#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 2180#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 2178#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 2177#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2171#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2172#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2175#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2181#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2161#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2162#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2176#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2179#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2174#L517-4 lis_~i~0#1 := 1; 2163#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2164#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 2168#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 2151#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2152#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 2166#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2155#L519-2 [2024-11-19 14:25:48,615 INFO L747 eck$LassoCheckResult]: Loop: 2155#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 2156#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2146#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 2147#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 2184#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 2183#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 2182#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2155#L519-2 [2024-11-19 14:25:48,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2024-11-19 14:25:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:48,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945267631] [2024-11-19 14:25:48,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:48,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:48,654 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:25:48,658 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:48,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:48,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:48,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:48,681 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 5 times [2024-11-19 14:25:48,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:48,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361976074] [2024-11-19 14:25:48,681 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:25:48,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:48,689 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:25:48,690 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:48,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:48,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:48,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1635630457, now seen corresponding path program 1 times [2024-11-19 14:25:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:48,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946523325] [2024-11-19 14:25:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 14:25:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946523325] [2024-11-19 14:25:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946523325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:25:48,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186289993] [2024-11-19 14:25:48,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:25:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:25:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:48,771 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:25:48,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2024-11-19 14:25:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:25:48,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 14:25:48,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 14:25:48,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:25:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 14:25:48,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186289993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:25:48,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:25:48,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-19 14:25:48,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848473520] [2024-11-19 14:25:48,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:25:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 14:25:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-19 14:25:49,076 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. cyclomatic complexity: 19 Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 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-11-19 14:25:49,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:25:49,142 INFO L93 Difference]: Finished difference Result 63 states and 84 transitions. [2024-11-19 14:25:49,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 84 transitions. [2024-11-19 14:25:49,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-19 14:25:49,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 42 states and 53 transitions. [2024-11-19 14:25:49,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-19 14:25:49,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2024-11-19 14:25:49,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2024-11-19 14:25:49,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:25:49,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-19 14:25:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2024-11-19 14:25:49,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-19 14:25:49,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 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-11-19 14:25:49,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-19 14:25:49,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-19 14:25:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 14:25:49,148 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-19 14:25:49,148 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-19 14:25:49,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2024-11-19 14:25:49,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-11-19 14:25:49,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:25:49,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:25:49,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:25:49,149 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2024-11-19 14:25:49,149 INFO L745 eck$LassoCheckResult]: Stem: 2487#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2477#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2478#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2471#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 2465#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 2466#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 2467#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 2468#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 2476#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 2494#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 2493#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2485#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2486#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2479#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2480#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2489#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2492#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2491#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2490#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2488#L517-4 lis_~i~0#1 := 1; 2481#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2482#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 2501#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 2472#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2473#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 2495#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2474#L519-2 [2024-11-19 14:25:49,151 INFO L747 eck$LassoCheckResult]: Loop: 2474#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 2475#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2498#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 2497#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 2496#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 2483#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 2469#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 2470#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 2484#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 2499#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 2500#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2474#L519-2 [2024-11-19 14:25:49,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:49,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2024-11-19 14:25:49,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:49,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818334718] [2024-11-19 14:25:49,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:25:49,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:49,187 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:25:49,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:49,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:49,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:49,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 6 times [2024-11-19 14:25:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:49,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237841728] [2024-11-19 14:25:49,201 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:25:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:49,210 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-19 14:25:49,210 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:25:49,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:25:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:25:49,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:25:49,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:25:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash 926303042, now seen corresponding path program 2 times [2024-11-19 14:25:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:25:49,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349656587] [2024-11-19 14:25:49,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:49,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:25:49,243 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:25:49,243 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:25:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:25:50,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:25:50,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349656587] [2024-11-19 14:25:50,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349656587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:25:50,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98694798] [2024-11-19 14:25:50,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:25:50,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:25:50,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:25:50,119 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:25:50,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2024-11-19 14:25:50,250 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:25:50,250 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:25:50,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 14:25:50,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:25:50,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 14:25:50,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 14:25:50,407 INFO L349 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2024-11-19 14:25:50,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 47 [2024-11-19 14:25:50,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 14:25:50,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2024-11-19 14:25:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 14:25:50,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:25:51,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 89 [2024-11-19 14:25:51,258 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-19 14:25:51,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 343 treesize of output 274 [2024-11-19 14:25:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 14:25:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98694798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:25:51,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:25:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 14] total 39 [2024-11-19 14:25:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809669086] [2024-11-19 14:25:51,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:25:51,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:25:51,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 14:25:51,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 14:25:51,700 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 12 Second operand has 39 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 39 states have internal predecessors, (86), 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-11-19 14:26:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:08,053 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2024-11-19 14:26:08,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 227 states and 330 transitions. [2024-11-19 14:26:08,054 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 112 [2024-11-19 14:26:08,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 227 states to 227 states and 330 transitions. [2024-11-19 14:26:08,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 213 [2024-11-19 14:26:08,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 213 [2024-11-19 14:26:08,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 330 transitions. [2024-11-19 14:26:08,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:08,064 INFO L218 hiAutomatonCegarLoop]: Abstraction has 227 states and 330 transitions. [2024-11-19 14:26:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 330 transitions. [2024-11-19 14:26:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 75. [2024-11-19 14:26:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 74 states have internal predecessors, (100), 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-11-19 14:26:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 100 transitions. [2024-11-19 14:26:08,071 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 100 transitions. [2024-11-19 14:26:08,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-11-19 14:26:08,074 INFO L425 stractBuchiCegarLoop]: Abstraction has 75 states and 100 transitions. [2024-11-19 14:26:08,074 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-19 14:26:08,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 100 transitions. [2024-11-19 14:26:08,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2024-11-19 14:26:08,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:08,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:08,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:08,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:26:08,075 INFO L745 eck$LassoCheckResult]: Stem: 3128#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3118#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3119#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3112#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3106#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 3107#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3108#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 3109#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3117#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 3135#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3134#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3126#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 3127#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3120#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3121#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3136#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3131#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3132#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3133#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3129#L517-4 lis_~i~0#1 := 1; 3130#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3146#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3145#L521 assume !lis_#t~short9#1; 3142#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 3143#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3137#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3138#L519-2 [2024-11-19 14:26:08,077 INFO L747 eck$LassoCheckResult]: Loop: 3138#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 3172#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3171#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3169#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 3168#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3123#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3110#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3111#L521 assume !lis_#t~short9#1; 3125#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3177#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3173#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3138#L519-2 [2024-11-19 14:26:08,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:08,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1035361376, now seen corresponding path program 1 times [2024-11-19 14:26:08,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:08,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434118766] [2024-11-19 14:26:08,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:08,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:08,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:08,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:08,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1576571771, now seen corresponding path program 1 times [2024-11-19 14:26:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:08,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997761078] [2024-11-19 14:26:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:26:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 14:26:08,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:08,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997761078] [2024-11-19 14:26:08,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997761078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:26:08,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:26:08,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:26:08,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201149791] [2024-11-19 14:26:08,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:26:08,139 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:26:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:08,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:26:08,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:26:08,139 INFO L87 Difference]: Start difference. First operand 75 states and 100 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-19 14:26:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:08,147 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2024-11-19 14:26:08,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 79 transitions. [2024-11-19 14:26:08,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-19 14:26:08,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 79 transitions. [2024-11-19 14:26:08,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-19 14:26:08,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2024-11-19 14:26:08,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 79 transitions. [2024-11-19 14:26:08,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:08,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-19 14:26:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 79 transitions. [2024-11-19 14:26:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-19 14:26:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 64 states have internal predecessors, (79), 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-11-19 14:26:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2024-11-19 14:26:08,155 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-19 14:26:08,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:26:08,156 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 79 transitions. [2024-11-19 14:26:08,156 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-19 14:26:08,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 79 transitions. [2024-11-19 14:26:08,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-19 14:26:08,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:08,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:08,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:08,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2024-11-19 14:26:08,157 INFO L745 eck$LassoCheckResult]: Stem: 3273#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3265#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3258#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3252#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 3253#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3254#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 3255#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3263#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 3281#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3280#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3271#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 3272#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3266#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3267#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3276#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3279#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3278#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3277#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3274#L517-4 lis_~i~0#1 := 1; 3275#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3299#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3297#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 3296#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3295#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3294#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3293#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 3292#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3291#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3290#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 3289#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3288#L520-2 [2024-11-19 14:26:08,157 INFO L747 eck$LassoCheckResult]: Loop: 3288#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3308#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3305#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 3303#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 3304#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3307#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3261#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 3262#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3268#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3300#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 3301#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 3288#L520-2 [2024-11-19 14:26:08,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1856448556, now seen corresponding path program 1 times [2024-11-19 14:26:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:08,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777056855] [2024-11-19 14:26:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:08,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:08,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:08,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1668400361, now seen corresponding path program 7 times [2024-11-19 14:26:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:08,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984752922] [2024-11-19 14:26:08,213 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:26:08,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:08,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:08,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:08,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1805133002, now seen corresponding path program 3 times [2024-11-19 14:26:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:08,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217101888] [2024-11-19 14:26:08,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:26:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:08,297 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:26:08,300 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 14:26:08,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:08,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217101888] [2024-11-19 14:26:08,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217101888] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:26:08,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906233599] [2024-11-19 14:26:08,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:26:08,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:26:08,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:26:08,473 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:26:08,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2024-11-19 14:26:08,648 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-19 14:26:08,648 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:08,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 14:26:08,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:26:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 14:26:08,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:26:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 14:26:08,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906233599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:26:08,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:26:08,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-19 14:26:08,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747477913] [2024-11-19 14:26:08,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:26:09,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 14:26:09,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-11-19 14:26:09,192 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. cyclomatic complexity: 17 Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 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-11-19 14:26:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:09,377 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2024-11-19 14:26:09,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 143 transitions. [2024-11-19 14:26:09,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-19 14:26:09,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 116 states and 140 transitions. [2024-11-19 14:26:09,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-19 14:26:09,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-19 14:26:09,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 140 transitions. [2024-11-19 14:26:09,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:09,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 116 states and 140 transitions. [2024-11-19 14:26:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 140 transitions. [2024-11-19 14:26:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2024-11-19 14:26:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 108 states have internal predecessors, (133), 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-11-19 14:26:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2024-11-19 14:26:09,381 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 133 transitions. [2024-11-19 14:26:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 14:26:09,382 INFO L425 stractBuchiCegarLoop]: Abstraction has 109 states and 133 transitions. [2024-11-19 14:26:09,382 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-19 14:26:09,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 133 transitions. [2024-11-19 14:26:09,382 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2024-11-19 14:26:09,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:09,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:09,383 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:09,383 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:26:09,383 INFO L745 eck$LassoCheckResult]: Stem: 3741#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3731#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3732#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3725#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 3719#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 3720#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3752#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 3754#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3721#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 3722#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 3728#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3739#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 3740#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3744#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3745#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3733#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3734#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3750#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3751#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3742#L517-4 lis_~i~0#1 := 1; 3743#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3806#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3805#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 3760#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3761#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3823#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3822#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 3735#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3723#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3724#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 3737#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3815#L520-2 [2024-11-19 14:26:09,383 INFO L747 eck$LassoCheckResult]: Loop: 3815#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 3821#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 3816#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 3817#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 3815#L520-2 [2024-11-19 14:26:09,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1856448556, now seen corresponding path program 2 times [2024-11-19 14:26:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:09,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044203788] [2024-11-19 14:26:09,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:26:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:09,405 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:26:09,406 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:09,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:09,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:09,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 3 times [2024-11-19 14:26:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982747356] [2024-11-19 14:26:09,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:26:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:09,428 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:26:09,428 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:09,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:09,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:09,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash 115317839, now seen corresponding path program 4 times [2024-11-19 14:26:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:09,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806112224] [2024-11-19 14:26:09,432 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:26:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:09,454 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:26:09,455 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:09,852 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 14:26:09,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806112224] [2024-11-19 14:26:09,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806112224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:26:09,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615888944] [2024-11-19 14:26:09,852 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:26:09,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:26:09,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:26:09,854 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:26:09,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2024-11-19 14:26:09,958 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:26:09,958 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:09,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 14:26:09,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:26:09,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-19 14:26:10,048 INFO L349 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2024-11-19 14:26:10,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 35 [2024-11-19 14:26:10,111 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-19 14:26:10,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 17 [2024-11-19 14:26:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 14:26:10,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:26:10,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2024-11-19 14:26:10,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 14:26:10,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 72 [2024-11-19 14:26:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 14:26:10,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615888944] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:26:10,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:26:10,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2024-11-19 14:26:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751197308] [2024-11-19 14:26:10,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:26:10,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:10,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 14:26:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-11-19 14:26:10,475 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. cyclomatic complexity: 29 Second operand has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 19 states have internal predecessors, (46), 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-11-19 14:26:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:10,631 INFO L93 Difference]: Finished difference Result 147 states and 182 transitions. [2024-11-19 14:26:10,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 182 transitions. [2024-11-19 14:26:10,631 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2024-11-19 14:26:10,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 182 transitions. [2024-11-19 14:26:10,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 127 [2024-11-19 14:26:10,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2024-11-19 14:26:10,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 182 transitions. [2024-11-19 14:26:10,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:10,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 182 transitions. [2024-11-19 14:26:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 182 transitions. [2024-11-19 14:26:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 126. [2024-11-19 14:26:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 125 states have internal predecessors, (156), 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-11-19 14:26:10,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2024-11-19 14:26:10,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 156 transitions. [2024-11-19 14:26:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 14:26:10,636 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 156 transitions. [2024-11-19 14:26:10,636 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-19 14:26:10,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 156 transitions. [2024-11-19 14:26:10,637 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2024-11-19 14:26:10,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:10,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:10,637 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:10,637 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:26:10,637 INFO L745 eck$LassoCheckResult]: Stem: 4231#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4222#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4215#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 4209#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 4210#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 4238#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 4239#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 4211#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 4212#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 4220#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4229#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4230#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4223#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4224#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4234#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4240#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4236#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4235#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4232#L517-4 lis_~i~0#1 := 1; 4233#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4319#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 4318#L521 assume !lis_#t~short9#1; 4245#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 4243#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 4244#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4218#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 4219#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4328#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 4329#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 4323#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4324#L520-2 [2024-11-19 14:26:10,637 INFO L747 eck$LassoCheckResult]: Loop: 4324#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 4327#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 4325#L521 assume !lis_#t~short9#1; 4228#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 4324#L520-2 [2024-11-19 14:26:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1985736812, now seen corresponding path program 1 times [2024-11-19 14:26:10,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:10,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211281021] [2024-11-19 14:26:10,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:10,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:10,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:10,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:10,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:10,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2942522, now seen corresponding path program 1 times [2024-11-19 14:26:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837930033] [2024-11-19 14:26:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:10,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:10,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:10,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash -213322675, now seen corresponding path program 2 times [2024-11-19 14:26:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:10,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881580263] [2024-11-19 14:26:10,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:26:10,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:10,743 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:26:10,743 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 14:26:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881580263] [2024-11-19 14:26:11,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881580263] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:26:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730133391] [2024-11-19 14:26:11,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:26:11,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:26:11,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:26:11,193 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:26:11,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2024-11-19 14:26:11,309 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:26:11,309 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:11,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 14:26:11,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:26:11,521 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 14:26:11,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 23 [2024-11-19 14:26:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 14:26:11,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:26:11,734 INFO L349 Elim1Store]: treesize reduction 5, result has 93.2 percent of original size [2024-11-19 14:26:11,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 79 [2024-11-19 14:26:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 14:26:11,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730133391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:26:11,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:26:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 29 [2024-11-19 14:26:11,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306076368] [2024-11-19 14:26:11,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:26:11,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:11,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 14:26:11,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2024-11-19 14:26:11,940 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. cyclomatic complexity: 36 Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 29 states have internal predecessors, (61), 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-11-19 14:26:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:12,485 INFO L93 Difference]: Finished difference Result 173 states and 215 transitions. [2024-11-19 14:26:12,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 173 states and 215 transitions. [2024-11-19 14:26:12,486 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 50 [2024-11-19 14:26:12,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 173 states to 173 states and 215 transitions. [2024-11-19 14:26:12,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2024-11-19 14:26:12,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2024-11-19 14:26:12,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 215 transitions. [2024-11-19 14:26:12,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:12,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 215 transitions. [2024-11-19 14:26:12,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 215 transitions. [2024-11-19 14:26:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 150. [2024-11-19 14:26:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.22) internal successors, (183), 149 states have internal predecessors, (183), 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-11-19 14:26:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 183 transitions. [2024-11-19 14:26:12,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 183 transitions. [2024-11-19 14:26:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 14:26:12,491 INFO L425 stractBuchiCegarLoop]: Abstraction has 150 states and 183 transitions. [2024-11-19 14:26:12,491 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-19 14:26:12,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 183 transitions. [2024-11-19 14:26:12,491 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2024-11-19 14:26:12,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:12,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:12,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:12,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:12,494 INFO L745 eck$LassoCheckResult]: Stem: 4800#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4790#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4791#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4784#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 4778#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 4779#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 4815#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 4816#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 4780#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 4781#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 4789#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 4811#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 4810#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4812#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4803#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4804#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4805#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4806#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4817#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4809#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4807#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4808#L517-4 lis_~i~0#1 := 1; 4847#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4846#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 4844#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 4845#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4887#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 4886#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4885#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 4884#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4883#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 4882#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 4880#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4878#L520-2 [2024-11-19 14:26:12,494 INFO L747 eck$LassoCheckResult]: Loop: 4878#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 4875#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 4866#L521 assume !lis_#t~short9#1; 4869#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 4867#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 4863#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4862#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 4860#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4858#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 4853#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 4854#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4878#L520-2 [2024-11-19 14:26:12,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -217563726, now seen corresponding path program 3 times [2024-11-19 14:26:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:12,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126967089] [2024-11-19 14:26:12,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:26:12,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:12,527 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 14:26:12,528 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:12,644 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 14:26:12,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:12,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126967089] [2024-11-19 14:26:12,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126967089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:26:12,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767406928] [2024-11-19 14:26:12,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:26:12,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:26:12,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:26:12,647 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:26:12,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2024-11-19 14:26:12,840 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-19 14:26:12,840 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:12,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 14:26:12,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:26:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 14:26:12,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:26:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 14:26:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767406928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:26:12,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:26:12,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-11-19 14:26:12,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154585472] [2024-11-19 14:26:12,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:26:12,981 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-19 14:26:12,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1946508567, now seen corresponding path program 1 times [2024-11-19 14:26:12,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:12,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637570224] [2024-11-19 14:26:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:12,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:12,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:12,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:13,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 14:26:13,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-19 14:26:13,326 INFO L87 Difference]: Start difference. First operand 150 states and 183 transitions. cyclomatic complexity: 39 Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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-11-19 14:26:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:13,442 INFO L93 Difference]: Finished difference Result 153 states and 186 transitions. [2024-11-19 14:26:13,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 186 transitions. [2024-11-19 14:26:13,443 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2024-11-19 14:26:13,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 186 transitions. [2024-11-19 14:26:13,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2024-11-19 14:26:13,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2024-11-19 14:26:13,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 186 transitions. [2024-11-19 14:26:13,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:13,445 INFO L218 hiAutomatonCegarLoop]: Abstraction has 153 states and 186 transitions. [2024-11-19 14:26:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 186 transitions. [2024-11-19 14:26:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2024-11-19 14:26:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 152 states have (on average 1.2171052631578947) internal successors, (185), 151 states have internal predecessors, (185), 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-11-19 14:26:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 185 transitions. [2024-11-19 14:26:13,448 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 185 transitions. [2024-11-19 14:26:13,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 14:26:13,449 INFO L425 stractBuchiCegarLoop]: Abstraction has 152 states and 185 transitions. [2024-11-19 14:26:13,449 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-19 14:26:13,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 185 transitions. [2024-11-19 14:26:13,450 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2024-11-19 14:26:13,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:13,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:13,452 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:13,452 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-19 14:26:13,452 INFO L745 eck$LassoCheckResult]: Stem: 5318#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5309#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5301#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 5295#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 5296#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 5331#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 5332#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 5297#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 5298#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 5327#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5328#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 5321#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5310#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5311#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5334#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5335#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5329#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5330#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5319#L517-4 lis_~i~0#1 := 1; 5320#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5385#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 5383#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 5344#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5345#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 5441#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5440#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 5312#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5313#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 5446#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 5424#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5445#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 5443#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 5442#L521 assume !lis_#t~short9#1; 5428#L521-2 [2024-11-19 14:26:13,452 INFO L747 eck$LassoCheckResult]: Loop: 5428#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 5438#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 5437#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 5426#L521 assume !lis_#t~short9#1; 5428#L521-2 [2024-11-19 14:26:13,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:13,452 INFO L85 PathProgramCache]: Analyzing trace with hash 835003923, now seen corresponding path program 1 times [2024-11-19 14:26:13,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175117944] [2024-11-19 14:26:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:13,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:13,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2895272, now seen corresponding path program 2 times [2024-11-19 14:26:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:13,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621334877] [2024-11-19 14:26:13,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:26:13,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:13,503 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:26:13,503 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:13,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:13,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:13,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash -538182982, now seen corresponding path program 3 times [2024-11-19 14:26:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:13,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501538961] [2024-11-19 14:26:13,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:26:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:13,523 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 14:26:13,523 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 14:26:13,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:13,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501538961] [2024-11-19 14:26:13,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501538961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:26:13,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522618897] [2024-11-19 14:26:13,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:26:13,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:26:13,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:26:13,657 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:26:13,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2024-11-19 14:26:13,818 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 14:26:13,818 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:13,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 14:26:13,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:26:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 14:26:13,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:26:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-19 14:26:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522618897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:26:13,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:26:13,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-19 14:26:13,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312226262] [2024-11-19 14:26:13,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:26:13,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 14:26:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-19 14:26:13,981 INFO L87 Difference]: Start difference. First operand 152 states and 185 transitions. cyclomatic complexity: 39 Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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-11-19 14:26:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:14,063 INFO L93 Difference]: Finished difference Result 165 states and 192 transitions. [2024-11-19 14:26:14,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 192 transitions. [2024-11-19 14:26:14,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2024-11-19 14:26:14,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 111 states and 132 transitions. [2024-11-19 14:26:14,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-11-19 14:26:14,065 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-11-19 14:26:14,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 132 transitions. [2024-11-19 14:26:14,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:14,065 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 132 transitions. [2024-11-19 14:26:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 132 transitions. [2024-11-19 14:26:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2024-11-19 14:26:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 99 states have (on average 1.202020202020202) internal successors, (119), 98 states have internal predecessors, (119), 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-11-19 14:26:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2024-11-19 14:26:14,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 119 transitions. [2024-11-19 14:26:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 14:26:14,068 INFO L425 stractBuchiCegarLoop]: Abstraction has 99 states and 119 transitions. [2024-11-19 14:26:14,069 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-19 14:26:14,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 119 transitions. [2024-11-19 14:26:14,069 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2024-11-19 14:26:14,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:14,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:14,070 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:14,070 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2024-11-19 14:26:14,070 INFO L745 eck$LassoCheckResult]: Stem: 5876#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5867#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5868#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5861#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 5855#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 5856#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 5857#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 5858#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 5864#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 5888#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 5887#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 5884#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 5883#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5874#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 5875#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5869#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5870#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5879#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5886#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5885#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5882#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5881#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5880#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5877#L517-4 lis_~i~0#1 := 1; 5878#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5931#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 5929#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 5930#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5944#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 5943#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5942#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 5871#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5859#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 5860#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 5862#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5863#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 5872#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 5951#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 5947#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5945#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 5932#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5925#L519-2 [2024-11-19 14:26:14,071 INFO L747 eck$LassoCheckResult]: Loop: 5925#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 5923#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5921#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 5918#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 5914#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5911#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 5909#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 5907#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 5905#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5900#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 5901#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5925#L519-2 [2024-11-19 14:26:14,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1830415302, now seen corresponding path program 4 times [2024-11-19 14:26:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537341345] [2024-11-19 14:26:14,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:26:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:14,109 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:26:14,110 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:14,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:14,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:14,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:14,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1576512189, now seen corresponding path program 1 times [2024-11-19 14:26:14,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:14,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866980917] [2024-11-19 14:26:14,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:26:14,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:14,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:14,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:14,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1228216092, now seen corresponding path program 5 times [2024-11-19 14:26:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:14,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504265743] [2024-11-19 14:26:14,154 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:26:14,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:14,195 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-19 14:26:14,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:26:14,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:26:14,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504265743] [2024-11-19 14:26:14,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504265743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:26:14,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236518114] [2024-11-19 14:26:14,300 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:26:14,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:26:14,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:26:14,303 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:26:14,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2024-11-19 14:26:16,133 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-19 14:26:16,134 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:26:16,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:26:16,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:26:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 37 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:26:16,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:26:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 33 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 14:26:16,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236518114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:26:16,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:26:16,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-11-19 14:26:16,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965865866] [2024-11-19 14:26:16,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:26:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:26:16,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 14:26:16,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-19 14:26:16,748 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. cyclomatic complexity: 24 Second operand has 14 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 14 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-11-19 14:26:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:26:16,887 INFO L93 Difference]: Finished difference Result 119 states and 147 transitions. [2024-11-19 14:26:16,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 147 transitions. [2024-11-19 14:26:16,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2024-11-19 14:26:16,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 147 transitions. [2024-11-19 14:26:16,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2024-11-19 14:26:16,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2024-11-19 14:26:16,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 147 transitions. [2024-11-19 14:26:16,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:26:16,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 147 transitions. [2024-11-19 14:26:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 147 transitions. [2024-11-19 14:26:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2024-11-19 14:26:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 108 states have internal predecessors, (133), 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-11-19 14:26:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2024-11-19 14:26:16,890 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 133 transitions. [2024-11-19 14:26:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 14:26:16,891 INFO L425 stractBuchiCegarLoop]: Abstraction has 109 states and 133 transitions. [2024-11-19 14:26:16,891 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-19 14:26:16,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 133 transitions. [2024-11-19 14:26:16,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2024-11-19 14:26:16,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:26:16,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:26:16,892 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:26:16,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 14:26:16,893 INFO L745 eck$LassoCheckResult]: Stem: 6442#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6433#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6426#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 6420#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 6421#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 6422#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 6423#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 6431#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 6454#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 6453#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 6450#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 6449#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6440#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 6441#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6434#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6435#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6445#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6452#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6451#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6448#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6447#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6446#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6443#L517-4 lis_~i~0#1 := 1; 6444#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6468#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 6478#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 6477#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6476#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 6475#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6474#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 6473#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6472#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 6471#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 6470#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6467#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 6465#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 6466#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 6461#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6462#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 6492#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6429#L519-2 [2024-11-19 14:26:16,893 INFO L747 eck$LassoCheckResult]: Loop: 6429#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 6430#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6512#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 6510#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 6508#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6507#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 6506#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 6505#L521 assume !lis_#t~short9#1; 6502#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 6500#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 6501#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 6488#L521 assume !lis_#t~short9#1; 6459#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 6457#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 6458#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6429#L519-2 [2024-11-19 14:26:16,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:16,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1830415302, now seen corresponding path program 6 times [2024-11-19 14:26:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:16,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589279688] [2024-11-19 14:26:16,893 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:26:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:16,944 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-11-19 14:26:16,944 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:16,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:17,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:17,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash 708860278, now seen corresponding path program 2 times [2024-11-19 14:26:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:17,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135057753] [2024-11-19 14:26:17,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:26:17,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:17,015 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:26:17,015 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:17,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:17,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:26:17,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:26:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1298803741, now seen corresponding path program 4 times [2024-11-19 14:26:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:26:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069680820] [2024-11-19 14:26:17,021 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:26:17,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:26:17,056 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:26:17,056 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:26:17,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:26:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:26:17,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:05,771 WARN L286 SmtUtils]: Spent 48.33s on a formula simplification. DAG size of input: 456 DAG size of output: 318 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-19 14:27:07,339 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 14:27:07,339 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 14:27:07,339 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 14:27:07,339 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 14:27:07,340 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 14:27:07,340 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:07,340 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 14:27:07,340 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 14:27:07,340 INFO L132 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration21_Lasso [2024-11-19 14:27:07,340 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 14:27:07,340 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 14:27:07,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:07,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:07,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:07,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:07,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:07,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:09,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 14:27:10,521 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 14:27:10,521 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 14:27:10,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,523 INFO L229 MonitoredProcess]: Starting monitored process 69 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-11-19 14:27:10,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2024-11-19 14:27:10,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:27:10,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:27:10,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:27:10,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:27:10,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:27:10,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-19 14:27:10,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,552 INFO L229 MonitoredProcess]: Starting monitored process 70 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-11-19 14:27:10,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2024-11-19 14:27:10,554 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-11-19 14:27:10,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:27:10,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:27:10,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:27:10,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:27:10,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2024-11-19 14:27:10,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,579 INFO L229 MonitoredProcess]: Starting monitored process 71 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-11-19 14:27:10,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2024-11-19 14:27:10,581 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-11-19 14:27:10,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:27:10,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:27:10,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:27:10,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-19 14:27:10,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,608 INFO L229 MonitoredProcess]: Starting monitored process 72 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-11-19 14:27:10,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2024-11-19 14:27:10,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 14:27:10,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:27:10,622 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:27:10,625 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:27:10,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-19 14:27:10,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,637 INFO L229 MonitoredProcess]: Starting monitored process 73 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-11-19 14:27:10,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-19 14:27:10,640 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-11-19 14:27:10,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 14:27:10,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 14:27:10,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 14:27:10,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:27:10,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2024-11-19 14:27:10,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,664 INFO L229 MonitoredProcess]: Starting monitored process 74 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-11-19 14:27:10,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2024-11-19 14:27:10,666 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-11-19 14:27:10,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:27:10,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:27:10,687 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:27:10,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-19 14:27:10,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,715 INFO L229 MonitoredProcess]: Starting monitored process 75 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-11-19 14:27:10,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2024-11-19 14:27:10,718 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-11-19 14:27:10,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:27:10,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:27:10,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:27:10,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2024-11-19 14:27:10,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,756 INFO L229 MonitoredProcess]: Starting monitored process 76 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-11-19 14:27:10,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2024-11-19 14:27:10,760 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-11-19 14:27:10,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:27:10,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:27:10,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:27:10,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2024-11-19 14:27:10,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,786 INFO L229 MonitoredProcess]: Starting monitored process 77 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-11-19 14:27:10,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2024-11-19 14:27:10,788 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-11-19 14:27:10,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:27:10,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:27:10,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 14:27:10,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-19 14:27:10,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,815 INFO L229 MonitoredProcess]: Starting monitored process 78 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-11-19 14:27:10,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2024-11-19 14:27:10,816 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-11-19 14:27:10,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 14:27:10,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 14:27:10,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 14:27:10,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 14:27:10,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 14:27:10,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 14:27:10,835 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 14:27:10,846 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 14:27:10,847 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2024-11-19 14:27:10,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:27:10,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:27:10,849 INFO L229 MonitoredProcess]: Starting monitored process 79 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-11-19 14:27:10,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2024-11-19 14:27:10,850 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 14:27:10,862 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-19 14:27:10,862 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 14:27:10,862 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_2) = 1*v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset (* ULTIMATE.start_lis_~i~0#1 4)))_2 Supporting invariants [1*v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~prev~0#1.base) (+ ULTIMATE.start_lis_~prev~0#1.offset 8))_1 - 1 >= 0] [2024-11-19 14:27:10,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-11-19 14:27:10,988 INFO L156 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2024-11-19 14:27:10,990 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 14:27:10,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 14:27:10,991 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~prev~0!base,]]] [2024-11-19 14:27:11,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:11,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:27:11,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:27:11,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 14:27:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:11,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:27:11,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:27:11,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2024-11-19 14:27:11,292 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2024-11-19 14:27:11,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2024-11-19 14:27:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:11,459 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 8 loop predicates [2024-11-19 14:27:11,459 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 133 transitions. cyclomatic complexity: 28 Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-11-19 14:27:11,497 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 133 transitions. cyclomatic complexity: 28. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 109 states and 133 transitions. Complement of second has 4 states. [2024-11-19 14:27:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:27:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-11-19 14:27:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2024-11-19 14:27:11,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 41 letters. Loop has 15 letters. [2024-11-19 14:27:11,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:27:11,500 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:27:11,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:11,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:27:11,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:27:11,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 14:27:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:11,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:27:11,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:27:11,843 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2024-11-19 14:27:11,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2024-11-19 14:27:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:12,048 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 8 loop predicates [2024-11-19 14:27:12,049 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 133 transitions. cyclomatic complexity: 28 Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-11-19 14:27:12,095 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 133 transitions. cyclomatic complexity: 28. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 109 states and 133 transitions. Complement of second has 4 states. [2024-11-19 14:27:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-19 14:27:12,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-11-19 14:27:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2024-11-19 14:27:12,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 41 letters. Loop has 15 letters. [2024-11-19 14:27:12,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:27:12,097 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 14:27:12,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:12,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:27:12,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:27:12,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 14:27:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:27:12,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 14:27:12,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:27:12,357 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2024-11-19 14:27:12,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2024-11-19 14:27:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:27:12,572 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 8 loop predicates [2024-11-19 14:27:12,572 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 133 transitions. cyclomatic complexity: 28 Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-11-19 14:27:12,891 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 133 transitions. cyclomatic complexity: 28. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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 337 states and 433 transitions. Complement of second has 33 states. [2024-11-19 14:27:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 8 stem states 7 non-accepting loop states 2 accepting loop states [2024-11-19 14:27:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 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-11-19 14:27:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 96 transitions. [2024-11-19 14:27:12,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 96 transitions. Stem has 41 letters. Loop has 15 letters. [2024-11-19 14:27:12,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:27:12,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 96 transitions. Stem has 56 letters. Loop has 15 letters. [2024-11-19 14:27:12,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:27:12,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 96 transitions. Stem has 41 letters. Loop has 30 letters. [2024-11-19 14:27:12,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 14:27:12,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 433 transitions. [2024-11-19 14:27:12,897 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 92 [2024-11-19 14:27:12,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 266 states and 336 transitions. [2024-11-19 14:27:12,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2024-11-19 14:27:12,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2024-11-19 14:27:12,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 336 transitions. [2024-11-19 14:27:12,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 14:27:12,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 266 states and 336 transitions. [2024-11-19 14:27:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 336 transitions. [2024-11-19 14:27:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 206. [2024-11-19 14:27:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 206 states have (on average 1.2621359223300972) internal successors, (260), 205 states have internal predecessors, (260), 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-11-19 14:27:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 260 transitions. [2024-11-19 14:27:12,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 206 states and 260 transitions. [2024-11-19 14:27:12,909 INFO L425 stractBuchiCegarLoop]: Abstraction has 206 states and 260 transitions. [2024-11-19 14:27:12,909 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-19 14:27:12,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 206 states and 260 transitions. [2024-11-19 14:27:12,909 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2024-11-19 14:27:12,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:27:12,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:27:12,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:27:12,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 1, 1, 1] [2024-11-19 14:27:12,910 INFO L745 eck$LassoCheckResult]: Stem: 7871#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7855#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet18#1, main_#t~post19#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 7856#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 7845#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 4294967296);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0; 7837#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 7838#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 7839#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 7840#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 7883#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 7881#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 7879#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);havoc main_#t~nondet18#1;call write~int#2(main_#t~nondet18#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet18#1; 7876#L535-2 main_#t~post19#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post19#1;havoc main_#t~post19#1; 7875#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 7869#L535-4 havoc main_~i~1#1;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem5#1, lis_#t~mem6#1, lis_#t~mem8#1, lis_#t~mem7#1, lis_#t~short9#1, lis_#t~mem10#1, lis_#t~post11#1, lis_#t~post12#1, lis_#t~mem13#1, lis_#t~mem14#1, lis_#t~post15#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 4294967296);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 7870#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7857#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7858#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7874#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7884#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7882#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7880#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#0(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7878#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 7877#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 7872#L517-4 lis_~i~0#1 := 1; 7873#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7941#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 7939#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 7938#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7937#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 7936#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 7935#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 7934#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7933#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 7932#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 7931#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7929#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 7928#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 7926#L521 assume lis_#t~short9#1;call lis_#t~mem8#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem7#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem8#1 < 1 + lis_#t~mem7#1; 7924#L521-2 assume lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1;call lis_#t~mem10#1 := read~int#0(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#0(1 + lis_#t~mem10#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#1(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 7925#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 7912#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 7902#L519-2 [2024-11-19 14:27:12,910 INFO L747 eck$LassoCheckResult]: Loop: 7902#L519-2 lis_#t~post12#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post12#1;havoc lis_#t~post12#1; 7903#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 7968#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 7966#L521 assume !lis_#t~short9#1; 7964#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 7962#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 7958#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 7956#L521 assume !lis_#t~short9#1; 7955#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 7953#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 7948#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem5#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem6#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short9#1 := lis_#t~mem5#1 > lis_#t~mem6#1; 7945#L521 assume !lis_#t~short9#1; 7923#L521-2 assume !lis_#t~short9#1;havoc lis_#t~mem5#1;havoc lis_#t~mem6#1;havoc lis_#t~mem8#1;havoc lis_#t~mem7#1;havoc lis_#t~short9#1; 7916#L520-2 lis_#t~post11#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post11#1;havoc lis_#t~post11#1; 7917#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 7902#L519-2 [2024-11-19 14:27:12,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:12,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1830415302, now seen corresponding path program 7 times [2024-11-19 14:27:12,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:12,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853036233] [2024-11-19 14:27:12,914 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:27:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:12,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:13,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:13,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1668090294, now seen corresponding path program 1 times [2024-11-19 14:27:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328055494] [2024-11-19 14:27:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:27:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:13,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:13,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:27:13,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:27:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2036933539, now seen corresponding path program 5 times [2024-11-19 14:27:13,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:27:13,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827712813] [2024-11-19 14:27:13,057 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:27:13,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:27:13,171 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-19 14:27:13,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:27:13,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:27:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:27:13,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace