./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 c3fed411 Calling Ultimate with: /usr/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.graphml --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.2-tmp.no-commuhash-c3fed41 [2021-12-19 20:28:12,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 20:28:12,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 20:28:12,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 20:28:12,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 20:28:12,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 20:28:12,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 20:28:12,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 20:28:12,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 20:28:12,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 20:28:12,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 20:28:12,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 20:28:12,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 20:28:12,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 20:28:12,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 20:28:12,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 20:28:12,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 20:28:12,591 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 20:28:12,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 20:28:12,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 20:28:12,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 20:28:12,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 20:28:12,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 20:28:12,602 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 20:28:12,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 20:28:12,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 20:28:12,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 20:28:12,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 20:28:12,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 20:28:12,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 20:28:12,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 20:28:12,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 20:28:12,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 20:28:12,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 20:28:12,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 20:28:12,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 20:28:12,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 20:28:12,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 20:28:12,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 20:28:12,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 20:28:12,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 20:28:12,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-19 20:28:12,637 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 20:28:12,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 20:28:12,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 20:28:12,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 20:28:12,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 20:28:12,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 20:28:12,639 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 20:28:12,639 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 20:28:12,639 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 20:28:12,639 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 20:28:12,640 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 20:28:12,640 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 20:28:12,640 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 20:28:12,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 20:28:12,641 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 20:28:12,641 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 20:28:12,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 20:28:12,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 20:28:12,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 20:28:12,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 20:28:12,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 20:28:12,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 20:28:12,642 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 20:28:12,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 20:28:12,643 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 20:28:12,643 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 20:28:12,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 20:28:12,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 20:28:12,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 20:28:12,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 20:28:12,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 20:28:12,644 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 20:28:12,645 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 20:28:12,645 INFO L138 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.graphml 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 [2021-12-19 20:28:12,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 20:28:12,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 20:28:12,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 20:28:12,874 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 20:28:12,875 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 20:28:12,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-12-19 20:28:12,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19f1da20/0e005553abec489b9907e161e0a8f3ce/FLAG987bd6db2 [2021-12-19 20:28:13,337 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 20:28:13,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2021-12-19 20:28:13,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19f1da20/0e005553abec489b9907e161e0a8f3ce/FLAG987bd6db2 [2021-12-19 20:28:13,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19f1da20/0e005553abec489b9907e161e0a8f3ce [2021-12-19 20:28:13,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 20:28:13,380 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 20:28:13,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 20:28:13,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 20:28:13,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 20:28:13,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1b4a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13, skipping insertion in model container [2021-12-19 20:28:13,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 20:28:13,416 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 20:28:13,589 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 20:28:13,594 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 20:28:13,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 20:28:13,632 INFO L208 MainTranslator]: Completed translation [2021-12-19 20:28:13,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13 WrapperNode [2021-12-19 20:28:13,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 20:28:13,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 20:28:13,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 20:28:13,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 20:28:13,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,660 INFO L137 Inliner]: procedures = 116, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 113 [2021-12-19 20:28:13,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 20:28:13,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 20:28:13,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 20:28:13,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 20:28:13,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 20:28:13,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 20:28:13,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 20:28:13,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 20:28:13,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (1/1) ... [2021-12-19 20:28:13,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:13,697 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) [2021-12-19 20:28:13,763 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 [2021-12-19 20:28:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-19 20:28:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-19 20:28:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 20:28:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 20:28:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 20:28:13,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 20:28:13,885 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 20:28:13,886 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 20:28:14,071 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 20:28:14,075 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 20:28:14,075 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-19 20:28:14,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:28:14 BoogieIcfgContainer [2021-12-19 20:28:14,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 20:28:14,077 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 20:28:14,077 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 20:28:14,081 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 20:28:14,082 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:28:14,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 08:28:13" (1/3) ... [2021-12-19 20:28:14,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7d8d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 08:28:14, skipping insertion in model container [2021-12-19 20:28:14,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:28:14,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:28:13" (2/3) ... [2021-12-19 20:28:14,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e7d8d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 08:28:14, skipping insertion in model container [2021-12-19 20:28:14,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 20:28:14,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:28:14" (3/3) ... [2021-12-19 20:28:14,085 INFO L388 chiAutomizerObserver]: Analyzing ICFG lis-alloca-1.i [2021-12-19 20:28:14,116 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 20:28:14,116 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 20:28:14,116 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 20:28:14,117 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 20:28:14,117 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 20:28:14,117 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 20:28:14,117 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 20:28:14,117 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 20:28:14,130 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) [2021-12-19 20:28:14,145 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-12-19 20:28:14,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:14,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:14,149 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 20:28:14,149 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:28:14,149 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 20:28:14,150 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) [2021-12-19 20:28:14,154 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2021-12-19 20:28:14,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:14,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:14,155 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 20:28:14,155 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:28:14,159 INFO L791 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;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); 7#L530-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 4#L535-3true [2021-12-19 20:28:14,159 INFO L793 eck$LassoCheckResult]: Loop: 4#L535-3true assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 17#L535-2true main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4#L535-3true [2021-12-19 20:28:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2021-12-19 20:28:14,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:14,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355253730] [2021-12-19 20:28:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:14,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:14,252 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:14,277 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:14,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2021-12-19 20:28:14,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:14,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419584701] [2021-12-19 20:28:14,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:14,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:14,298 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:14,311 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2021-12-19 20:28:14,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:14,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658952856] [2021-12-19 20:28:14,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:14,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:14,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:14,371 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:14,624 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:28:14,628 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:28:14,628 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:28:14,628 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:28:14,628 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:28:14,628 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:14,628 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:28:14,629 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:28:14,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration1_Lasso [2021-12-19 20:28:14,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:28:14,629 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:28:14,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:14,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:14,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:14,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:14,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:14,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:14,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:14,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:14,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:14,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:15,010 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:28:15,013 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:28:15,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:15,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:15,040 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) [2021-12-19 20:28:15,043 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 [2021-12-19 20:28:15,044 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 [2021-12-19 20:28:15,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:15,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:15,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:15,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:15,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:15,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:15,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:15,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:15,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:15,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:15,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:15,100 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) [2021-12-19 20:28:15,102 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 [2021-12-19 20:28:15,103 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 [2021-12-19 20:28:15,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:15,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:15,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:15,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:15,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:15,114 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:15,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:15,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:15,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:15,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:15,164 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) [2021-12-19 20:28:15,165 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 [2021-12-19 20:28:15,166 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 [2021-12-19 20:28:15,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:15,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:15,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:15,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:15,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:15,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:15,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:15,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:15,209 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 [2021-12-19 20:28:15,209 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:15,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:15,211 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) [2021-12-19 20:28:15,221 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 [2021-12-19 20:28:15,221 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 [2021-12-19 20:28:15,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:15,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:15,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:15,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:15,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:15,250 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:15,272 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:28:15,307 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2021-12-19 20:28:15,308 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-12-19 20:28:15,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:15,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:15,310 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) [2021-12-19 20:28:15,311 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 [2021-12-19 20:28:15,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:28:15,333 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-19 20:28:15,334 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:28:15,334 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1) = -2*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~numbers~0#1.base)_1 - 2*ULTIMATE.start_main_~array_size~0#1 >= 0] [2021-12-19 20:28:15,350 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 [2021-12-19 20:28:15,369 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2021-12-19 20:28:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:15,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 20:28:15,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:15,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 20:28:15,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:15,492 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-19 20:28:15,493 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 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) [2021-12-19 20:28:15,564 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 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) Result 47 states and 74 transitions. Complement of second has 9 states. [2021-12-19 20:28:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 20:28:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2021-12-19 20:28:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2021-12-19 20:28:15,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-19 20:28:15,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:15,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-19 20:28:15,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:15,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-19 20:28:15,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:15,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 74 transitions. [2021-12-19 20:28:15,580 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-19 20:28:15,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 33 transitions. [2021-12-19 20:28:15,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-19 20:28:15,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-19 20:28:15,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2021-12-19 20:28:15,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:28:15,586 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2021-12-19 20:28:15,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2021-12-19 20:28:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-19 20:28:15,609 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) [2021-12-19 20:28:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2021-12-19 20:28:15,611 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2021-12-19 20:28:15,611 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2021-12-19 20:28:15,611 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 20:28:15,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 33 transitions. [2021-12-19 20:28:15,613 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-19 20:28:15,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:15,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:15,614 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 20:28:15,614 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:28:15,614 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 155#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 151#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 142#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 144#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 157#L517-3 [2021-12-19 20:28:15,615 INFO L793 eck$LassoCheckResult]: Loop: 157#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 156#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 157#L517-3 [2021-12-19 20:28:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2021-12-19 20:28:15,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:15,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542471979] [2021-12-19 20:28:15,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:15,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:15,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-19 20:28:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:15,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:15,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542471979] [2021-12-19 20:28:15,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542471979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:28:15,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:28:15,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 20:28:15,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337445306] [2021-12-19 20:28:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:28:15,661 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:28:15,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2021-12-19 20:28:15,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:15,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669124264] [2021-12-19 20:28:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:15,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:15,668 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:15,683 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:15,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:15,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 20:28:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 20:28:15,765 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) [2021-12-19 20:28:15,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:15,788 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-12-19 20:28:15,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 20:28:15,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-12-19 20:28:15,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-19 20:28:15,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-12-19 20:28:15,790 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-19 20:28:15,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-19 20:28:15,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-12-19 20:28:15,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:28:15,791 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-12-19 20:28:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-12-19 20:28:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2021-12-19 20:28:15,792 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) [2021-12-19 20:28:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2021-12-19 20:28:15,793 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-12-19 20:28:15,793 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2021-12-19 20:28:15,793 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 20:28:15,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2021-12-19 20:28:15,793 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2021-12-19 20:28:15,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:15,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:15,794 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:15,794 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-19 20:28:15,794 INFO L791 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 197#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 205#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 201#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 192#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 193#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 194#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 195#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 207#L517-3 [2021-12-19 20:28:15,794 INFO L793 eck$LassoCheckResult]: Loop: 207#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 206#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 207#L517-3 [2021-12-19 20:28:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:15,795 INFO L85 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2021-12-19 20:28:15,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:15,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671404953] [2021-12-19 20:28:15,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:15,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:15,806 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:15,817 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2021-12-19 20:28:15,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:15,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685666468] [2021-12-19 20:28:15,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:15,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:15,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:15,827 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2021-12-19 20:28:15,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:15,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254179426] [2021-12-19 20:28:15,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:15,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:15,852 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:15,874 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:16,419 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:28:16,419 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:28:16,419 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:28:16,419 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:28:16,419 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:28:16,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:16,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:28:16,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:28:16,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration3_Lasso [2021-12-19 20:28:16,420 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:28:16,420 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:28:16,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:16,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:17,109 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:28:17,109 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:28:17,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,116 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) [2021-12-19 20:28:17,117 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 [2021-12-19 20:28:17,119 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 [2021-12-19 20:28:17,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:17,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,154 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) [2021-12-19 20:28:17,155 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 [2021-12-19 20:28:17,156 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 [2021-12-19 20:28:17,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,180 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 [2021-12-19 20:28:17,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,182 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) [2021-12-19 20:28:17,183 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 [2021-12-19 20:28:17,184 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 [2021-12-19 20:28:17,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,209 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 [2021-12-19 20:28:17,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,211 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) [2021-12-19 20:28:17,212 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 [2021-12-19 20:28:17,213 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 [2021-12-19 20:28:17,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,243 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 [2021-12-19 20:28:17,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,244 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) [2021-12-19 20:28:17,245 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 [2021-12-19 20:28:17,246 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 [2021-12-19 20:28:17,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,284 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 [2021-12-19 20:28:17,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,286 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) [2021-12-19 20:28:17,287 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 [2021-12-19 20:28:17,287 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 [2021-12-19 20:28:17,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:17,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:17,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,313 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 [2021-12-19 20:28:17,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,315 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) [2021-12-19 20:28:17,316 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 [2021-12-19 20:28:17,317 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 [2021-12-19 20:28:17,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:17,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,345 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) [2021-12-19 20:28:17,347 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 [2021-12-19 20:28:17,348 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 [2021-12-19 20:28:17,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:17,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:17,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:17,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,392 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) [2021-12-19 20:28:17,393 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 [2021-12-19 20:28:17,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:17,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,421 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 [2021-12-19 20:28:17,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,423 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) [2021-12-19 20:28:17,424 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 [2021-12-19 20:28:17,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:17,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,481 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 [2021-12-19 20:28:17,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,488 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) [2021-12-19 20:28:17,489 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 [2021-12-19 20:28:17,491 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 [2021-12-19 20:28:17,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,517 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 [2021-12-19 20:28:17,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,518 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) [2021-12-19 20:28:17,519 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 [2021-12-19 20:28:17,520 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 [2021-12-19 20:28:17,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,528 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:17,545 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,546 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) [2021-12-19 20:28:17,548 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 [2021-12-19 20:28:17,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:17,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:17,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:17,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,575 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 [2021-12-19 20:28:17,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,576 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) [2021-12-19 20:28:17,578 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 [2021-12-19 20:28:17,578 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 [2021-12-19 20:28:17,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-12-19 20:28:17,603 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,611 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) [2021-12-19 20:28:17,612 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 [2021-12-19 20:28:17,614 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 [2021-12-19 20:28:17,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,640 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 [2021-12-19 20:28:17,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,642 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) [2021-12-19 20:28:17,642 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 [2021-12-19 20:28:17,643 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 [2021-12-19 20:28:17,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:17,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:17,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-19 20:28:17,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,670 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) [2021-12-19 20:28:17,672 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 [2021-12-19 20:28:17,673 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 [2021-12-19 20:28:17,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,697 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 [2021-12-19 20:28:17,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,700 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) [2021-12-19 20:28:17,701 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 [2021-12-19 20:28:17,702 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 [2021-12-19 20:28:17,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-19 20:28:17,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,727 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) [2021-12-19 20:28:17,728 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 [2021-12-19 20:28:17,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:17,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:17,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:17,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2021-12-19 20:28:17,771 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,772 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) [2021-12-19 20:28:17,774 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 [2021-12-19 20:28:17,776 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 [2021-12-19 20:28:17,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-19 20:28:17,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,815 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) [2021-12-19 20:28:17,816 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 [2021-12-19 20:28:17,817 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 [2021-12-19 20:28:17,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-19 20:28:17,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,843 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) [2021-12-19 20:28:17,847 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 [2021-12-19 20:28:17,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:17,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,854 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:17,854 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:17,873 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 [2021-12-19 20:28:17,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:17,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,901 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) [2021-12-19 20:28:17,916 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 [2021-12-19 20:28:17,917 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 [2021-12-19 20:28:17,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:17,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:17,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:17,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-12-19 20:28:17,957 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:17,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:17,958 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) [2021-12-19 20:28:17,959 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 [2021-12-19 20:28:17,960 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 [2021-12-19 20:28:17,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:17,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:17,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:17,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:17,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:17,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:17,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:18,017 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 [2021-12-19 20:28:18,018 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:18,032 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) [2021-12-19 20:28:18,040 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 [2021-12-19 20:28:18,040 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 [2021-12-19 20:28:18,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:18,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:18,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:18,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:18,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:18,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:18,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:18,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:18,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-19 20:28:18,064 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:18,065 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:18,065 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 [2021-12-19 20:28:18,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:18,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:18,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:18,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:18,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:18,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:18,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:18,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:18,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:18,104 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 [2021-12-19 20:28:18,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:18,105 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) [2021-12-19 20:28:18,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-19 20:28:18,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:18,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:18,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:18,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:18,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:18,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:18,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:18,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:28:18,180 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-12-19 20:28:18,180 INFO L444 ModelExtractionUtils]: 9 out of 55 variables were initially zero. Simplification set additionally 42 variables to zero. [2021-12-19 20:28:18,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:18,196 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) [2021-12-19 20:28:18,197 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 [2021-12-19 20:28:18,199 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:28:18,206 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:28:18,207 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:28:18,207 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~prev~0#1.offset, v_rep(select #length ULTIMATE.start_lis_~prev~0#1.base)_1, ULTIMATE.start_lis_~i~0#1) = -1*ULTIMATE.start_lis_~prev~0#1.offset + 2*v_rep(select #length ULTIMATE.start_lis_~prev~0#1.base)_1 - 4*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2021-12-19 20:28:18,223 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 [2021-12-19 20:28:18,276 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 [2021-12-19 20:28:18,282 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2021-12-19 20:28:18,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:18,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 20:28:18,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:18,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 20:28:18,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:18,341 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-19 20:28:18,341 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) [2021-12-19 20:28:18,351 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 24 states and 35 transitions. Complement of second has 7 states. [2021-12-19 20:28:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 20:28:18,352 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) [2021-12-19 20:28:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-19 20:28:18,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2021-12-19 20:28:18,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:18,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-19 20:28:18,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:18,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2021-12-19 20:28:18,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:18,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2021-12-19 20:28:18,354 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-19 20:28:18,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 31 transitions. [2021-12-19 20:28:18,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-19 20:28:18,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-19 20:28:18,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2021-12-19 20:28:18,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:28:18,355 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-12-19 20:28:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2021-12-19 20:28:18,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-12-19 20:28:18,356 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) [2021-12-19 20:28:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2021-12-19 20:28:18,356 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-12-19 20:28:18,356 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2021-12-19 20:28:18,357 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 20:28:18,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2021-12-19 20:28:18,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-19 20:28:18,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:18,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:18,357 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:18,358 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 20:28:18,358 INFO L791 eck$LassoCheckResult]: Stem: 367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 368#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 376#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 372#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 363#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 364#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 365#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 366#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 383#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 384#L517-4 lis_~i~0#1 := 1; 375#L519-3 [2021-12-19 20:28:18,358 INFO L793 eck$LassoCheckResult]: Loop: 375#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 369#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 370#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 375#L519-3 [2021-12-19 20:28:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2021-12-19 20:28:18,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:18,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592565887] [2021-12-19 20:28:18,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:18,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:28:18,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:18,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592565887] [2021-12-19 20:28:18,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592565887] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:28:18,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:28:18,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 20:28:18,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341256021] [2021-12-19 20:28:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:28:18,387 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:28:18,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash 74687, now seen corresponding path program 1 times [2021-12-19 20:28:18,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:18,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147636651] [2021-12-19 20:28:18,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:18,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:18,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:18,392 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:18,405 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:28:18,406 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:28:18,406 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:28:18,406 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:28:18,406 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 20:28:18,406 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,406 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:28:18,406 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:28:18,406 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-12-19 20:28:18,406 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:28:18,407 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:28:18,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,452 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:28:18,453 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 20:28:18,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:18,455 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) [2021-12-19 20:28:18,456 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 [2021-12-19 20:28:18,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 20:28:18,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 20:28:18,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:18,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:18,485 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 20:28:18,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-19 20:28:18,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 20:28:18,487 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 20:28:18,573 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 20:28:18,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-19 20:28:18,576 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:28:18,576 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:28:18,576 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:28:18,576 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:28:18,576 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:28:18,577 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,577 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:28:18,577 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:28:18,577 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration4_Loop [2021-12-19 20:28:18,577 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:28:18,577 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:28:18,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:18,625 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:28:18,625 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:28:18,625 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:18,626 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) [2021-12-19 20:28:18,628 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 [2021-12-19 20:28:18,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:18,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:18,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:18,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:18,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:18,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:18,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:18,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:18,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:28:18,640 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 20:28:18,640 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 20:28:18,640 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:18,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:18,684 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) [2021-12-19 20:28:18,685 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 [2021-12-19 20:28:18,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:28:18,685 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 20:28:18,685 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:28:18,685 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2021-12-19 20:28:18,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-19 20:28:18,701 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 20:28:18,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:18,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 20:28:18,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:18,749 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 20:28:18,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:18,782 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-19 20:28:18,782 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) [2021-12-19 20:28:18,826 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 43 states and 67 transitions. Complement of second has 9 states. [2021-12-19 20:28:18,827 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 [2021-12-19 20:28:18,827 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) [2021-12-19 20:28:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-12-19 20:28:18,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2021-12-19 20:28:18,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:18,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 13 letters. Loop has 3 letters. [2021-12-19 20:28:18,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:18,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 10 letters. Loop has 6 letters. [2021-12-19 20:28:18,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:18,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 67 transitions. [2021-12-19 20:28:18,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2021-12-19 20:28:18,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 62 transitions. [2021-12-19 20:28:18,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-19 20:28:18,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-19 20:28:18,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2021-12-19 20:28:18,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:18,830 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 62 transitions. [2021-12-19 20:28:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2021-12-19 20:28:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-12-19 20:28:18,832 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) [2021-12-19 20:28:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2021-12-19 20:28:18,832 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 50 transitions. [2021-12-19 20:28:18,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:18,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 20:28:18,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 20:28:18,833 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) [2021-12-19 20:28:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:18,863 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2021-12-19 20:28:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 20:28:18,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2021-12-19 20:28:18,865 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-19 20:28:18,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2021-12-19 20:28:18,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-19 20:28:18,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-19 20:28:18,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2021-12-19 20:28:18,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:18,866 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2021-12-19 20:28:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2021-12-19 20:28:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-19 20:28:18,868 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) [2021-12-19 20:28:18,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2021-12-19 20:28:18,868 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-12-19 20:28:18,868 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 49 transitions. [2021-12-19 20:28:18,868 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 20:28:18,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 49 transitions. [2021-12-19 20:28:18,869 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-19 20:28:18,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:18,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:18,869 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:18,869 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:18,870 INFO L791 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 570#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 585#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 576#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 565#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 566#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 567#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 568#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 594#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 586#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 587#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 595#L517-4 lis_~i~0#1 := 1; 596#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 571#L520-3 [2021-12-19 20:28:18,870 INFO L793 eck$LassoCheckResult]: Loop: 571#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 572#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 577#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 578#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 589#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 581#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 582#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 571#L520-3 [2021-12-19 20:28:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1792663252, now seen corresponding path program 1 times [2021-12-19 20:28:18,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:18,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317968275] [2021-12-19 20:28:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:18,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:28:18,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:18,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317968275] [2021-12-19 20:28:18,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317968275] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:18,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821870233] [2021-12-19 20:28:18,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:18,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:18,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:18,921 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:28:18,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-12-19 20:28:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:18,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 20:28:18,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:28:19,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:28:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:28:19,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821870233] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:28:19,043 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:28:19,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-19 20:28:19,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995930137] [2021-12-19 20:28:19,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:28:19,043 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:28:19,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 1 times [2021-12-19 20:28:19,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:19,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174923666] [2021-12-19 20:28:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:19,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:19,077 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:19,084 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:19,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:19,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:19,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 20:28:19,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-19 20:28:19,254 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.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:19,351 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2021-12-19 20:28:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-19 20:28:19,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 71 transitions. [2021-12-19 20:28:19,352 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2021-12-19 20:28:19,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 71 transitions. [2021-12-19 20:28:19,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-19 20:28:19,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-19 20:28:19,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 71 transitions. [2021-12-19 20:28:19,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:19,353 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 71 transitions. [2021-12-19 20:28:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 71 transitions. [2021-12-19 20:28:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2021-12-19 20:28:19,355 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) [2021-12-19 20:28:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2021-12-19 20:28:19,355 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2021-12-19 20:28:19,355 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 64 transitions. [2021-12-19 20:28:19,356 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 20:28:19,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. [2021-12-19 20:28:19,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2021-12-19 20:28:19,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:19,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:19,357 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:19,358 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 20:28:19,358 INFO L791 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 752#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 768#L530 assume main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911;main_~array_size~0#1 := 1; 771#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 746#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 747#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 764#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 788#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 787#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 786#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 785#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 784#L517-4 lis_~i~0#1 := 1; 772#L519-3 assume !(lis_~i~0#1 < lis_~N#1); 773#L519-4 lis_~i~0#1 := 0; 777#L523-3 [2021-12-19 20:28:19,358 INFO L793 eck$LassoCheckResult]: Loop: 777#L523-3 assume !!(lis_~i~0#1 < lis_~N#1);call lis_#t~mem14#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4); 778#L524 assume lis_~max~0#1 < lis_#t~mem14#1;havoc lis_#t~mem14#1;call lis_#t~mem15#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);lis_~max~0#1 := lis_#t~mem15#1;havoc lis_#t~mem15#1; 779#L523-2 lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post13#1;havoc lis_#t~post13#1; 777#L523-3 [2021-12-19 20:28:19,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash -520179462, now seen corresponding path program 1 times [2021-12-19 20:28:19,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:19,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240551249] [2021-12-19 20:28:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:19,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:19,392 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:19,404 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash 111317, now seen corresponding path program 1 times [2021-12-19 20:28:19,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:19,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415239093] [2021-12-19 20:28:19,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:19,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:19,408 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:19,411 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash -424266948, now seen corresponding path program 1 times [2021-12-19 20:28:19,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:19,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846441514] [2021-12-19 20:28:19,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:19,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:19,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:19,438 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:20,216 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 20:28:20,216 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 20:28:20,216 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 20:28:20,216 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 20:28:20,216 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 20:28:20,216 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:20,216 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 20:28:20,216 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 20:28:20,216 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-1.i_Iteration6_Lasso [2021-12-19 20:28:20,217 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 20:28:20,217 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 20:28:20,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 20:28:20,945 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 20:28:20,945 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 20:28:20,945 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:20,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:20,951 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) [2021-12-19 20:28:20,956 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 [2021-12-19 20:28:20,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 [2021-12-19 20:28:20,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:20,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:20,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:20,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:20,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:20,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:20,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:20,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:20,981 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 [2021-12-19 20:28:20,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:20,983 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) [2021-12-19 20:28:20,985 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 [2021-12-19 20:28:20,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 [2021-12-19 20:28:20,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:20,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:20,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:20,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:20,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:20,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:20,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:21,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:21,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-19 20:28:21,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:21,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,018 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) [2021-12-19 20:28:21,019 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 [2021-12-19 20:28:21,020 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 [2021-12-19 20:28:21,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:21,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:21,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:21,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:21,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:21,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:21,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:21,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:21,059 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 [2021-12-19 20:28:21,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:21,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,060 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) [2021-12-19 20:28:21,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 20:28:21,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:21,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 20:28:21,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:21,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:21,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:21,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 20:28:21,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 20:28:21,075 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 [2021-12-19 20:28:21,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:21,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-19 20:28:21,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:21,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,110 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) [2021-12-19 20:28:21,111 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 [2021-12-19 20:28:21,112 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 [2021-12-19 20:28:21,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:21,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:21,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:21,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:21,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:21,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:21,129 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:21,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-19 20:28:21,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:21,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,146 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) [2021-12-19 20:28:21,147 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 [2021-12-19 20:28:21,148 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 [2021-12-19 20:28:21,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:21,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:21,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:21,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:21,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:21,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:21,158 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:21,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-19 20:28:21,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:21,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,176 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) [2021-12-19 20:28:21,178 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 [2021-12-19 20:28:21,179 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 [2021-12-19 20:28:21,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:21,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:21,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:21,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:21,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:21,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:21,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:21,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-19 20:28:21,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:21,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,220 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) [2021-12-19 20:28:21,220 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 [2021-12-19 20:28:21,339 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 [2021-12-19 20:28:21,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:21,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:21,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:21,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:21,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:21,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:21,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:21,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-19 20:28:21,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:21,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,376 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) [2021-12-19 20:28:21,378 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 [2021-12-19 20:28:21,380 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 [2021-12-19 20:28:21,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:21,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:21,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:21,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:21,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:21,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:21,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 20:28:21,435 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 [2021-12-19 20:28:21,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,450 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) [2021-12-19 20:28:21,451 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 [2021-12-19 20:28:21,453 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 [2021-12-19 20:28:21,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 20:28:21,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 20:28:21,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 20:28:21,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 20:28:21,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-19 20:28:21,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-19 20:28:21,477 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 20:28:21,505 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2021-12-19 20:28:21,505 INFO L444 ModelExtractionUtils]: 11 out of 43 variables were initially zero. Simplification set additionally 28 variables to zero. [2021-12-19 20:28:21,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 20:28:21,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,507 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) [2021-12-19 20:28:21,508 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 [2021-12-19 20:28:21,509 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 20:28:21,524 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-19 20:28:21,524 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 20:28:21,524 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~best~0#1.offset, v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_2, ULTIMATE.start_lis_~i~0#1) = -1*ULTIMATE.start_lis_~best~0#1.offset + 1*v_rep(select #length ULTIMATE.start_lis_#t~malloc2#1.base)_2 - 4*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2021-12-19 20:28:21,541 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 [2021-12-19 20:28:21,575 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2021-12-19 20:28:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:21,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:28:21,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:21,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 20:28:21,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:21,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-19 20:28:21,665 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:21,687 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 64 transitions. cyclomatic complexity: 26. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 69 transitions. Complement of second has 5 states. [2021-12-19 20:28:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-19 20:28:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2021-12-19 20:28:21,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-19 20:28:21,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:21,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 17 letters. Loop has 3 letters. [2021-12-19 20:28:21,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:21,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 14 letters. Loop has 6 letters. [2021-12-19 20:28:21,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 20:28:21,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 69 transitions. [2021-12-19 20:28:21,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:28:21,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 31 states and 42 transitions. [2021-12-19 20:28:21,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-12-19 20:28:21,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-12-19 20:28:21,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2021-12-19 20:28:21,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:21,691 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-19 20:28:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2021-12-19 20:28:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-19 20:28:21,693 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) [2021-12-19 20:28:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2021-12-19 20:28:21,693 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-19 20:28:21,693 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2021-12-19 20:28:21,693 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 20:28:21,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2021-12-19 20:28:21,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:28:21,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:21,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:21,694 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:21,694 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:21,694 INFO L791 eck$LassoCheckResult]: Stem: 1009#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1010#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1024#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1016#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 1005#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1006#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1007#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1008#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1035#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1029#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 1030#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1025#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1026#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1031#L517-4 lis_~i~0#1 := 1; 1032#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1011#L520-3 [2021-12-19 20:28:21,694 INFO L793 eck$LassoCheckResult]: Loop: 1011#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1012#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1017#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1018#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1028#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1021#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1022#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1011#L520-3 [2021-12-19 20:28:21,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1166516274, now seen corresponding path program 2 times [2021-12-19 20:28:21,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:21,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601022277] [2021-12-19 20:28:21,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:21,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:21,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:21,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601022277] [2021-12-19 20:28:21,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601022277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:21,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145245699] [2021-12-19 20:28:21,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:28:21,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:21,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:21,754 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:28:21,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-12-19 20:28:21,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:28:21,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:28:21,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 20:28:21,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-19 20:28:21,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:28:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-19 20:28:21,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145245699] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:28:21,863 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:28:21,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2021-12-19 20:28:21,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865711507] [2021-12-19 20:28:21,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:28:21,864 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:28:21,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:21,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 2 times [2021-12-19 20:28:21,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:21,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110642345] [2021-12-19 20:28:21,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:21,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:21,869 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:21,873 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:22,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:22,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-19 20:28:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-12-19 20:28:22,016 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:22,123 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2021-12-19 20:28:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 20:28:22,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 65 transitions. [2021-12-19 20:28:22,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-19 20:28:22,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 65 transitions. [2021-12-19 20:28:22,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-19 20:28:22,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-19 20:28:22,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 65 transitions. [2021-12-19 20:28:22,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:22,131 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 65 transitions. [2021-12-19 20:28:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 65 transitions. [2021-12-19 20:28:22,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2021-12-19 20:28:22,133 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) [2021-12-19 20:28:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2021-12-19 20:28:22,133 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-19 20:28:22,133 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-19 20:28:22,133 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 20:28:22,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2021-12-19 20:28:22,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:28:22,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:22,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:22,134 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:22,135 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:22,135 INFO L791 eck$LassoCheckResult]: Stem: 1199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1200#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1215#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1206#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 1195#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1196#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1197#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1198#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1214#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1220#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 1221#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1224#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1225#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1216#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1217#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1222#L517-4 lis_~i~0#1 := 1; 1223#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1201#L520-3 [2021-12-19 20:28:22,135 INFO L793 eck$LassoCheckResult]: Loop: 1201#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1202#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1207#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1208#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1219#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1211#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1212#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1201#L520-3 [2021-12-19 20:28:22,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:22,135 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 3 times [2021-12-19 20:28:22,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:22,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534709558] [2021-12-19 20:28:22,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:22,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:22,186 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 [2021-12-19 20:28:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:22,190 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:22,209 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 3 times [2021-12-19 20:28:22,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:22,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781772594] [2021-12-19 20:28:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:22,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:22,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:22,218 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash 502604869, now seen corresponding path program 1 times [2021-12-19 20:28:22,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:22,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200827556] [2021-12-19 20:28:22,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:22,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-19 20:28:22,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200827556] [2021-12-19 20:28:22,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200827556] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136124412] [2021-12-19 20:28:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:22,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:22,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:22,288 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:28:22,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-12-19 20:28:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:22,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 20:28:22,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-19 20:28:22,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:28:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-19 20:28:22,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136124412] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:28:22,487 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:28:22,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2021-12-19 20:28:22,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781206609] [2021-12-19 20:28:22,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:28:22,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-19 20:28:22,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-19 20:28:22,624 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 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) [2021-12-19 20:28:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:22,710 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2021-12-19 20:28:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 20:28:22,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 78 transitions. [2021-12-19 20:28:22,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-19 20:28:22,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 49 states and 64 transitions. [2021-12-19 20:28:22,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-12-19 20:28:22,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-19 20:28:22,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2021-12-19 20:28:22,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:22,712 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2021-12-19 20:28:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2021-12-19 20:28:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-12-19 20:28:22,713 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) [2021-12-19 20:28:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-12-19 20:28:22,714 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-19 20:28:22,714 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-19 20:28:22,714 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 20:28:22,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2021-12-19 20:28:22,714 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-19 20:28:22,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:22,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:22,714 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:22,714 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:28:22,715 INFO L791 eck$LassoCheckResult]: Stem: 1458#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1459#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1473#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1465#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 1454#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1455#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1456#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1457#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1498#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1497#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 1496#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1494#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1493#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1492#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1491#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1489#L517-4 lis_~i~0#1 := 1; 1476#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1477#L520-3 [2021-12-19 20:28:22,715 INFO L793 eck$LassoCheckResult]: Loop: 1477#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1487#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1486#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1479#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1477#L520-3 [2021-12-19 20:28:22,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:22,715 INFO L85 PathProgramCache]: Analyzing trace with hash 37388752, now seen corresponding path program 4 times [2021-12-19 20:28:22,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:22,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689041557] [2021-12-19 20:28:22,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:22,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:22,727 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:22,737 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:22,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 1 times [2021-12-19 20:28:22,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:22,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421755566] [2021-12-19 20:28:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:22,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:22,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:22,759 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:22,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2057178037, now seen corresponding path program 1 times [2021-12-19 20:28:22,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:22,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225324795] [2021-12-19 20:28:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:22,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:22,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:22,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225324795] [2021-12-19 20:28:22,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225324795] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:22,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815500292] [2021-12-19 20:28:22,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:22,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:22,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:22,981 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:28:22,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-12-19 20:28:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:23,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-19 20:28:23,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:23,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-12-19 20:28:23,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 18 treesize of output 18 [2021-12-19 20:28:23,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-19 20:28:23,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:28:23,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-19 20:28:23,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 29 [2021-12-19 20:28:23,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:28:23,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 13 [2021-12-19 20:28:23,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-19 20:28:23,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:28:23,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (or (< 1 v_ArrVal_343) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_343)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) is different from false [2021-12-19 20:28:23,360 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) v_ArrVal_343)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< 1 v_ArrVal_343))) is different from false [2021-12-19 20:28:23,369 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:28:23,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 72 [2021-12-19 20:28:23,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 122 treesize of output 116 [2021-12-19 20:28:23,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:23,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 119 treesize of output 107 [2021-12-19 20:28:23,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:23,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 126 treesize of output 114 [2021-12-19 20:28:23,399 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-12-19 20:28:23,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 125 treesize of output 127 [2021-12-19 20:28:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2021-12-19 20:28:23,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815500292] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:28:23,553 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:28:23,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 23 [2021-12-19 20:28:23,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800708925] [2021-12-19 20:28:23,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:28:23,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:23,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-19 20:28:23,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=349, Unknown=2, NotChecked=78, Total=506 [2021-12-19 20:28:23,665 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 21 Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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) [2021-12-19 20:28:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:23,876 INFO L93 Difference]: Finished difference Result 117 states and 165 transitions. [2021-12-19 20:28:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-19 20:28:23,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 165 transitions. [2021-12-19 20:28:23,877 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2021-12-19 20:28:23,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 165 transitions. [2021-12-19 20:28:23,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2021-12-19 20:28:23,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2021-12-19 20:28:23,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 165 transitions. [2021-12-19 20:28:23,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:23,878 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 165 transitions. [2021-12-19 20:28:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 165 transitions. [2021-12-19 20:28:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 76. [2021-12-19 20:28:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.381578947368421) internal successors, (105), 75 states have internal predecessors, (105), 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) [2021-12-19 20:28:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2021-12-19 20:28:23,882 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2021-12-19 20:28:23,882 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 105 transitions. [2021-12-19 20:28:23,882 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 20:28:23,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 105 transitions. [2021-12-19 20:28:23,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-19 20:28:23,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:23,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:23,883 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:23,883 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:28:23,883 INFO L791 eck$LassoCheckResult]: Stem: 1783#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1784#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1798#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 1790#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 1779#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1780#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1781#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 1782#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 1816#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 1818#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 1812#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1813#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1814#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1815#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1848#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1846#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1845#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 1844#L517-4 lis_~i~0#1 := 1; 1842#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1839#L520-3 [2021-12-19 20:28:23,883 INFO L793 eck$LassoCheckResult]: Loop: 1839#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1837#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1834#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1835#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1839#L520-3 [2021-12-19 20:28:23,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1572565998, now seen corresponding path program 5 times [2021-12-19 20:28:23,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:23,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196891475] [2021-12-19 20:28:23,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:23,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:23,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:23,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196891475] [2021-12-19 20:28:23,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196891475] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:23,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121884059] [2021-12-19 20:28:23,962 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 20:28:23,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:23,964 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:28:23,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-12-19 20:28:24,034 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-19 20:28:24,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:28:24,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 20:28:24,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:24,103 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:24,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:28:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:24,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121884059] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:28:24,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:28:24,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2021-12-19 20:28:24,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906711386] [2021-12-19 20:28:24,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:28:24,155 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:28:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2558310, now seen corresponding path program 2 times [2021-12-19 20:28:24,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:24,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019478433] [2021-12-19 20:28:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:24,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:24,164 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:24,167 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:24,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:24,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 20:28:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-12-19 20:28:24,265 INFO L87 Difference]: Start difference. First operand 76 states and 105 transitions. cyclomatic complexity: 35 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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) [2021-12-19 20:28:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:24,396 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2021-12-19 20:28:24,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 20:28:24,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 100 transitions. [2021-12-19 20:28:24,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-19 20:28:24,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 100 transitions. [2021-12-19 20:28:24,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2021-12-19 20:28:24,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-12-19 20:28:24,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 100 transitions. [2021-12-19 20:28:24,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:24,397 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 100 transitions. [2021-12-19 20:28:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 100 transitions. [2021-12-19 20:28:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-12-19 20:28:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.375) internal successors, (99), 71 states have internal predecessors, (99), 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) [2021-12-19 20:28:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2021-12-19 20:28:24,399 INFO L704 BuchiCegarLoop]: Abstraction has 72 states and 99 transitions. [2021-12-19 20:28:24,399 INFO L587 BuchiCegarLoop]: Abstraction has 72 states and 99 transitions. [2021-12-19 20:28:24,399 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-19 20:28:24,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 99 transitions. [2021-12-19 20:28:24,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2021-12-19 20:28:24,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:24,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:24,400 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:24,400 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-19 20:28:24,400 INFO L791 eck$LassoCheckResult]: Stem: 2067#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2068#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2082#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2073#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2063#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2064#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2065#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2066#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2134#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2133#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 2130#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2083#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2084#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2127#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2126#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2096#L517-4 lis_~i~0#1 := 1; 2087#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2088#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2132#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2074#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2075#L520-2 [2021-12-19 20:28:24,401 INFO L793 eck$LassoCheckResult]: Loop: 2075#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2129#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2128#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2092#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2075#L520-2 [2021-12-19 20:28:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1451833899, now seen corresponding path program 1 times [2021-12-19 20:28:24,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:24,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873148963] [2021-12-19 20:28:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:24,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:24,450 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:24,464 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2942460, now seen corresponding path program 3 times [2021-12-19 20:28:24,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:24,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298193904] [2021-12-19 20:28:24,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:24,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:24,468 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:24,471 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:24,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 500759334, now seen corresponding path program 1 times [2021-12-19 20:28:24,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:24,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272459961] [2021-12-19 20:28:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:24,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-19 20:28:24,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:24,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272459961] [2021-12-19 20:28:24,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272459961] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:24,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271262932] [2021-12-19 20:28:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:24,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:24,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:24,543 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 20:28:24,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-12-19 20:28:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:24,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 20:28:24,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-19 20:28:24,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 20:28:24,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271262932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:28:24,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-19 20:28:24,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2021-12-19 20:28:24,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112467395] [2021-12-19 20:28:24,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:28:24,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 20:28:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-19 20:28:24,766 INFO L87 Difference]: Start difference. First operand 72 states and 99 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) [2021-12-19 20:28:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:24,798 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2021-12-19 20:28:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 20:28:24,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 103 transitions. [2021-12-19 20:28:24,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:28:24,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 64 states and 86 transitions. [2021-12-19 20:28:24,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-19 20:28:24,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-19 20:28:24,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 86 transitions. [2021-12-19 20:28:24,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:24,799 INFO L681 BuchiCegarLoop]: Abstraction has 64 states and 86 transitions. [2021-12-19 20:28:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 86 transitions. [2021-12-19 20:28:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2021-12-19 20:28:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 54 states have internal predecessors, (75), 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) [2021-12-19 20:28:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2021-12-19 20:28:24,801 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-12-19 20:28:24,801 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 75 transitions. [2021-12-19 20:28:24,801 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-19 20:28:24,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2021-12-19 20:28:24,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:28:24,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:24,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:24,802 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:24,802 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:24,802 INFO L791 eck$LassoCheckResult]: Stem: 2301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2302#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2316#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2307#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2297#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2298#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2299#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2300#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2336#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2335#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2334#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2330#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 2331#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2317#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2318#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2333#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2337#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2338#L517-4 lis_~i~0#1 := 1; 2342#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2343#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2326#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2308#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2309#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2324#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2312#L519-2 [2021-12-19 20:28:24,802 INFO L793 eck$LassoCheckResult]: Loop: 2312#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2313#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2303#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2304#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2347#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2346#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2345#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2312#L519-2 [2021-12-19 20:28:24,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:24,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1034531842, now seen corresponding path program 1 times [2021-12-19 20:28:24,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:24,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659067367] [2021-12-19 20:28:24,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:24,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:28:24,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:24,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659067367] [2021-12-19 20:28:24,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659067367] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:24,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868916459] [2021-12-19 20:28:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:24,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:24,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:24,850 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) [2021-12-19 20:28:24,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-12-19 20:28:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:24,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 20:28:24,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:28:24,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:28:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:28:25,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868916459] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:28:25,034 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:28:25,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-19 20:28:25,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25092232] [2021-12-19 20:28:25,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:28:25,034 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:28:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 4 times [2021-12-19 20:28:25,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:25,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437355352] [2021-12-19 20:28:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:25,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,038 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,041 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:25,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:25,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 20:28:25,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-19 20:28:25,158 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. cyclomatic complexity: 24 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) [2021-12-19 20:28:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:25,280 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2021-12-19 20:28:25,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 20:28:25,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2021-12-19 20:28:25,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:28:25,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 64 transitions. [2021-12-19 20:28:25,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-19 20:28:25,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-19 20:28:25,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2021-12-19 20:28:25,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:25,282 INFO L681 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2021-12-19 20:28:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2021-12-19 20:28:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2021-12-19 20:28:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 46 states have internal predecessors, (63), 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) [2021-12-19 20:28:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2021-12-19 20:28:25,300 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-12-19 20:28:25,300 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 63 transitions. [2021-12-19 20:28:25,300 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-19 20:28:25,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 63 transitions. [2021-12-19 20:28:25,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:28:25,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:25,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:25,301 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:25,301 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:25,302 INFO L791 eck$LassoCheckResult]: Stem: 2569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2570#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2583#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2575#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2565#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2566#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2567#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2568#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2599#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2597#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2596#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2589#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 2590#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2593#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2603#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2584#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2585#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2594#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2598#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2591#L517-4 lis_~i~0#1 := 1; 2592#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2602#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2601#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2600#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2571#L520-3 [2021-12-19 20:28:25,302 INFO L793 eck$LassoCheckResult]: Loop: 2571#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2572#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2576#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2577#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2586#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2580#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2581#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2571#L520-3 [2021-12-19 20:28:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:25,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1572106802, now seen corresponding path program 1 times [2021-12-19 20:28:25,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:25,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332564945] [2021-12-19 20:28:25,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:25,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-19 20:28:25,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:25,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332564945] [2021-12-19 20:28:25,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332564945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:28:25,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:28:25,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 20:28:25,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799931087] [2021-12-19 20:28:25,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:28:25,329 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:28:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1094746892, now seen corresponding path program 5 times [2021-12-19 20:28:25,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:25,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512272939] [2021-12-19 20:28:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:25,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,336 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:25,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:25,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 20:28:25,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 20:28:25,463 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:28:25,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:25,485 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2021-12-19 20:28:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 20:28:25,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2021-12-19 20:28:25,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:28:25,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 64 transitions. [2021-12-19 20:28:25,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2021-12-19 20:28:25,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2021-12-19 20:28:25,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 64 transitions. [2021-12-19 20:28:25,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:25,486 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2021-12-19 20:28:25,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 64 transitions. [2021-12-19 20:28:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-12-19 20:28:25,487 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) [2021-12-19 20:28:25,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2021-12-19 20:28:25,488 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-19 20:28:25,488 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2021-12-19 20:28:25,488 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-19 20:28:25,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2021-12-19 20:28:25,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-19 20:28:25,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:25,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:25,488 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:25,488 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:25,489 INFO L791 eck$LassoCheckResult]: Stem: 2672#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2673#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2686#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2678#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2668#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2669#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2670#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2671#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2705#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2702#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2701#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2696#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 2697#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2687#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2688#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2700#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2706#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2704#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2703#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2698#L517-4 lis_~i~0#1 := 1; 2699#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2674#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2675#L521 assume !lis_#t~short11#1; 2679#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2680#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2691#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2683#L519-2 [2021-12-19 20:28:25,489 INFO L793 eck$LassoCheckResult]: Loop: 2683#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2684#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2689#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2710#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2712#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2711#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2709#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2683#L519-2 [2021-12-19 20:28:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1035359454, now seen corresponding path program 1 times [2021-12-19 20:28:25,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:25,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306721377] [2021-12-19 20:28:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:25,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-19 20:28:25,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:25,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306721377] [2021-12-19 20:28:25,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306721377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 20:28:25,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 20:28:25,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 20:28:25,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793844333] [2021-12-19 20:28:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 20:28:25,510 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:28:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:25,511 INFO L85 PathProgramCache]: Analyzing trace with hash 782548870, now seen corresponding path program 6 times [2021-12-19 20:28:25,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:25,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349194393] [2021-12-19 20:28:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:25,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,517 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:25,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:25,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 20:28:25,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 20:28:25,636 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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) [2021-12-19 20:28:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:25,643 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2021-12-19 20:28:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 20:28:25,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 66 transitions. [2021-12-19 20:28:25,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-19 20:28:25,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 66 transitions. [2021-12-19 20:28:25,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-19 20:28:25,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-19 20:28:25,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2021-12-19 20:28:25,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 20:28:25,645 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-12-19 20:28:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2021-12-19 20:28:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-19 20:28:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 50 states have internal predecessors, (66), 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) [2021-12-19 20:28:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2021-12-19 20:28:25,646 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-12-19 20:28:25,647 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2021-12-19 20:28:25,647 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-19 20:28:25,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 66 transitions. [2021-12-19 20:28:25,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-19 20:28:25,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:25,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:25,648 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:25,648 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:25,648 INFO L791 eck$LassoCheckResult]: Stem: 2776#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2777#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2791#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 2782#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 2772#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2773#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2774#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2775#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2812#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 2809#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 2808#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 2803#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 2804#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2792#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2793#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2807#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2813#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2811#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2810#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 2805#L517-4 lis_~i~0#1 := 1; 2806#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2816#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2820#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2815#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2784#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2796#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2787#L519-2 [2021-12-19 20:28:25,648 INFO L793 eck$LassoCheckResult]: Loop: 2787#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2788#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2778#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2779#L521 assume !lis_#t~short11#1; 2800#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2818#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2817#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2787#L519-2 [2021-12-19 20:28:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 2 times [2021-12-19 20:28:25,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:25,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539448541] [2021-12-19 20:28:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:25,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,674 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,694 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:25,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash 782608452, now seen corresponding path program 1 times [2021-12-19 20:28:25,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:25,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354075744] [2021-12-19 20:28:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:25,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,698 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:25,701 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1635570875, now seen corresponding path program 1 times [2021-12-19 20:28:25,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:25,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651130267] [2021-12-19 20:28:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:25,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-19 20:28:25,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:25,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651130267] [2021-12-19 20:28:25,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651130267] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:25,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57456195] [2021-12-19 20:28:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:25,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:25,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:25,753 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) [2021-12-19 20:28:25,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2021-12-19 20:28:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:25,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 20:28:25,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-19 20:28:25,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:28:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-19 20:28:25,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57456195] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:28:25,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:28:25,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2021-12-19 20:28:25,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314906934] [2021-12-19 20:28:25,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:28:26,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:26,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 20:28:26,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-19 20:28:26,038 INFO L87 Difference]: Start difference. First operand 51 states and 66 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) [2021-12-19 20:28:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:26,105 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2021-12-19 20:28:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 20:28:26,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 90 transitions. [2021-12-19 20:28:26,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2021-12-19 20:28:26,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 56 transitions. [2021-12-19 20:28:26,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-12-19 20:28:26,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-12-19 20:28:26,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2021-12-19 20:28:26,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:28:26,106 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2021-12-19 20:28:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2021-12-19 20:28:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2021-12-19 20:28:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 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) [2021-12-19 20:28:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2021-12-19 20:28:26,107 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-12-19 20:28:26,107 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2021-12-19 20:28:26,107 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-19 20:28:26,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2021-12-19 20:28:26,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-12-19 20:28:26,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:26,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:26,108 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:26,108 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2021-12-19 20:28:26,108 INFO L791 eck$LassoCheckResult]: Stem: 3107#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3108#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3116#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3111#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 3103#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3104#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3105#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3106#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3132#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3131#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3130#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3123#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 3124#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3117#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3118#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3126#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3129#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3128#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3127#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3125#L517-4 lis_~i~0#1 := 1; 3120#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3121#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3142#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3140#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3139#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3133#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3114#L519-2 [2021-12-19 20:28:26,108 INFO L793 eck$LassoCheckResult]: Loop: 3114#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3115#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3138#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3137#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3136#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3119#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3109#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3110#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3122#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3113#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3134#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3114#L519-2 [2021-12-19 20:28:26,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:26,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1035299872, now seen corresponding path program 3 times [2021-12-19 20:28:26,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:26,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738777714] [2021-12-19 20:28:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:26,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:26,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:26,150 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash -943445823, now seen corresponding path program 7 times [2021-12-19 20:28:26,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:26,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194944572] [2021-12-19 20:28:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:26,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:26,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:28:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:28:26,161 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:28:26,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash 926303042, now seen corresponding path program 1 times [2021-12-19 20:28:26,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:26,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680112391] [2021-12-19 20:28:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:26,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:28:26,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:26,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680112391] [2021-12-19 20:28:26,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680112391] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:26,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542940343] [2021-12-19 20:28:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:26,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:26,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:26,752 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) [2021-12-19 20:28:26,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2021-12-19 20:28:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:26,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-19 20:28:26,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:26,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-12-19 20:28:26,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 18 treesize of output 18 [2021-12-19 20:28:26,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-19 20:28:26,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:28:26,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-19 20:28:26,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2021-12-19 20:28:27,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:27,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:28:27,165 INFO L354 Elim1Store]: treesize reduction 46, result has 41.0 percent of original size [2021-12-19 20:28:27,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 74 [2021-12-19 20:28:27,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 46 [2021-12-19 20:28:27,419 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:28:27,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 13 [2021-12-19 20:28:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-19 20:28:27,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:28:27,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_lis_~j~0#1| Int)) (or (forall ((v_ArrVal_851 Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (or (< v_ArrVal_851 (+ (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1)) (let ((.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_851)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_852) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 4)) (+ (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) 1))))))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (<= (+ (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1) (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4))))))) is different from false [2021-12-19 20:28:27,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 Int) (|ULTIMATE.start_lis_~j~0#1| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (+ (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1)) (.cse2 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4))) (or (< v_ArrVal_851 .cse0) (<= .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 v_ArrVal_851)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_852) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse3 .cse2) 1))))))) is different from false [2021-12-19 20:28:27,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (|ULTIMATE.start_lis_~j~0#1| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_847)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_849))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (+ (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1)) (.cse2 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4))) (or (< 1 v_ArrVal_847) (< v_ArrVal_851 .cse0) (<= .cse0 (select .cse1 .cse2)) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 v_ArrVal_851)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_852) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse3 .cse2) 1)))))))) is different from false [2021-12-19 20:28:27,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_847 Int) (|ULTIMATE.start_lis_~j~0#1| Int) (v_ArrVal_852 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) v_ArrVal_847)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_849))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (+ (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~j~0#1| 4))) 1)) (.cse2 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4))) (or (<= .cse0 (select .cse1 .cse2)) (< 1 v_ArrVal_847) (< v_ArrVal_851 .cse0) (let ((.cse3 (select (store (store .cse4 |c_ULTIMATE.start_lis_~best~0#1.base| (store .cse1 .cse2 v_ArrVal_851)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_852) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse3 .cse2) 1)))))))) is different from false [2021-12-19 20:28:27,884 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:28:27,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 398 treesize of output 242 [2021-12-19 20:28:27,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 423 treesize of output 413 [2021-12-19 20:28:27,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:27,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:27,918 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:28:27,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 311 treesize of output 309 [2021-12-19 20:28:27,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:27,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:27,952 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:28:27,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 323 treesize of output 359 [2021-12-19 20:28:27,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:27,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:27,993 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:28:27,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 554 treesize of output 542 [2021-12-19 20:28:28,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:28:28,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 200 treesize of output 168 [2021-12-19 20:28:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 14 not checked. [2021-12-19 20:28:29,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542940343] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:28:29,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:28:29,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 14] total 47 [2021-12-19 20:28:29,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73988270] [2021-12-19 20:28:29,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:28:29,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:28:29,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-19 20:28:29,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1635, Unknown=4, NotChecked=340, Total=2162 [2021-12-19 20:28:29,400 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 12 Second operand has 47 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 states have internal predecessors, (90), 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) [2021-12-19 20:28:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:28:34,070 INFO L93 Difference]: Finished difference Result 205 states and 266 transitions. [2021-12-19 20:28:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-12-19 20:28:34,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 266 transitions. [2021-12-19 20:28:34,072 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 94 [2021-12-19 20:28:34,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 205 states and 266 transitions. [2021-12-19 20:28:34,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2021-12-19 20:28:34,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2021-12-19 20:28:34,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 205 states and 266 transitions. [2021-12-19 20:28:34,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:28:34,074 INFO L681 BuchiCegarLoop]: Abstraction has 205 states and 266 transitions. [2021-12-19 20:28:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states and 266 transitions. [2021-12-19 20:28:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 73. [2021-12-19 20:28:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 72 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) [2021-12-19 20:28:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2021-12-19 20:28:34,076 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 94 transitions. [2021-12-19 20:28:34,076 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 94 transitions. [2021-12-19 20:28:34,076 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-19 20:28:34,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 94 transitions. [2021-12-19 20:28:34,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:28:34,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:28:34,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:28:34,077 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:28:34,077 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2021-12-19 20:28:34,077 INFO L791 eck$LassoCheckResult]: Stem: 3772#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3773#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3782#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 3776#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 3768#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3769#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3770#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3771#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3781#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 3795#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 3794#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 3788#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 3789#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3783#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3784#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3797#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3792#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 3793#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 3796#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 3790#L517-4 lis_~i~0#1 := 1; 3791#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3814#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3812#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3803#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3804#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3835#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 3834#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 3833#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 3832#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3831#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3828#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3778#L520-2 [2021-12-19 20:28:34,077 INFO L793 eck$LassoCheckResult]: Loop: 3778#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3774#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3775#L521 assume !lis_#t~short11#1; 3787#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3800#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 3838#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 3837#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 3836#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 3778#L520-2 [2021-12-19 20:28:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:28:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1629172116, now seen corresponding path program 2 times [2021-12-19 20:28:34,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:28:34,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55282575] [2021-12-19 20:28:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:28:34,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:28:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:28:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:28:34,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:28:34,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55282575] [2021-12-19 20:28:34,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55282575] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:28:34,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939371359] [2021-12-19 20:28:34,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:28:34,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:28:34,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:28:34,584 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) [2021-12-19 20:28:34,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2021-12-19 20:28:34,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:28:34,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:28:34,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-19 20:28:34,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:28:34,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-12-19 20:28:34,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 18 treesize of output 18 [2021-12-19 20:28:34,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-19 20:28:34,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:28:34,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2021-12-19 20:28:34,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 30 [2021-12-19 20:28:34,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:28:34,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:28:34,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:28:34,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-12-19 20:28:34,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 32 [2021-12-19 20:29:18,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:29:18,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:29:18,604 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:29:18,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 16 [2021-12-19 20:29:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-19 20:29:18,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:29:18,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_925 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) is different from false [2021-12-19 20:29:18,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_168| Int)) (or (forall ((v_ArrVal_925 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_168| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (< |v_ULTIMATE.start_lis_~i~0#1_168| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2021-12-19 20:29:18,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_168| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_921 Int)) (or (< 1 v_ArrVal_921) (< |v_ULTIMATE.start_lis_~i~0#1_168| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_921)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_922))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_168| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) is different from false [2021-12-19 20:29:18,786 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_168| Int) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_921 Int)) (or (< 1 v_ArrVal_921) (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) v_ArrVal_921)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_922))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_168| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_168| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)))) is different from false [2021-12-19 20:29:18,798 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:29:18,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 146 [2021-12-19 20:29:18,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 261 treesize of output 255 [2021-12-19 20:29:18,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:29:18,838 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:29:18,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 886 treesize of output 858 [2021-12-19 20:29:18,877 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-19 20:29:18,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 655 treesize of output 631 [2021-12-19 20:29:18,889 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-19 20:29:18,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 749 treesize of output 725 [2021-12-19 20:29:18,942 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-19 20:29:18,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1653 treesize of output 1557 [2021-12-19 20:29:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 8 not checked. [2021-12-19 20:29:19,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939371359] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:29:19,871 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:29:19,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2021-12-19 20:29:19,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047576761] [2021-12-19 20:29:19,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:29:19,871 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:29:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1231419467, now seen corresponding path program 1 times [2021-12-19 20:29:19,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:19,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337153206] [2021-12-19 20:29:19,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:19,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:19,876 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:19,879 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:20,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-19 20:29:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=752, Unknown=7, NotChecked=236, Total=1122 [2021-12-19 20:29:20,029 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. cyclomatic complexity: 25 Second operand has 34 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 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) [2021-12-19 20:29:21,254 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse4 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse2 (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse4)))) (and (let ((.cse0 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (or (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse0 9) (* 4 |c_ULTIMATE.start_lis_~N#1|)) (and (= (select .cse1 0) 1) (= .cse2 1) (<= (+ (div (* |c_ULTIMATE.start_lis_~best~0#1.offset| (- 1)) 4) 3) |c_ULTIMATE.start_lis_~N#1|) (= 4 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse0))))) (forall ((|v_ULTIMATE.start_lis_~i~0#1_168| Int)) (or (forall ((v_ArrVal_925 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_168| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_925) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (< |v_ULTIMATE.start_lis_~i~0#1_168| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (= |c_ULTIMATE.start_lis_~i~0#1| 1) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= |c_ULTIMATE.start_main_~numbers~0#1.offset| 0) (<= 12 (* 4 |c_ULTIMATE.start_main_~array_size~0#1|)) (<= .cse2 1) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (<= 1 (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse4 (- 4)))) (let ((.cse5 (* 4 |c_ULTIMATE.start_main_~i~1#1|))) (or (= .cse5 8) (< 8 .cse5))) (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|))))) is different from false [2021-12-19 20:29:31,508 WARN L227 SmtUtils]: Spent 9.87s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-19 20:29:46,102 WARN L227 SmtUtils]: Spent 14.58s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-19 20:29:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:46,623 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2021-12-19 20:29:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-19 20:29:46,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 105 transitions. [2021-12-19 20:29:46,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:29:46,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 105 transitions. [2021-12-19 20:29:46,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2021-12-19 20:29:46,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2021-12-19 20:29:46,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 105 transitions. [2021-12-19 20:29:46,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:29:46,625 INFO L681 BuchiCegarLoop]: Abstraction has 82 states and 105 transitions. [2021-12-19 20:29:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 105 transitions. [2021-12-19 20:29:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2021-12-19 20:29:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.2875) internal successors, (103), 79 states have internal predecessors, (103), 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) [2021-12-19 20:29:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2021-12-19 20:29:46,626 INFO L704 BuchiCegarLoop]: Abstraction has 80 states and 103 transitions. [2021-12-19 20:29:46,626 INFO L587 BuchiCegarLoop]: Abstraction has 80 states and 103 transitions. [2021-12-19 20:29:46,627 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-19 20:29:46,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 103 transitions. [2021-12-19 20:29:46,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:29:46,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:46,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:46,627 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:46,627 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-19 20:29:46,627 INFO L791 eck$LassoCheckResult]: Stem: 4167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4168#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4176#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4171#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 4163#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4164#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4165#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4166#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4194#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4193#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4192#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4185#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 4186#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4189#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4190#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4191#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4199#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4177#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4178#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4187#L517-4 lis_~i~0#1 := 1; 4188#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4239#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4238#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4234#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4233#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4232#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4231#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4230#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4228#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4226#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4224#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4181#L520-2 [2021-12-19 20:29:46,628 INFO L793 eck$LassoCheckResult]: Loop: 4181#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4169#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4170#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4241#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4240#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4242#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4174#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4175#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4203#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4202#L521 assume !lis_#t~short11#1; 4200#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4181#L520-2 [2021-12-19 20:29:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1856448556, now seen corresponding path program 1 times [2021-12-19 20:29:46,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:46,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256070776] [2021-12-19 20:29:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:46,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:46,660 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:46,687 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1668400423, now seen corresponding path program 1 times [2021-12-19 20:29:46,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:46,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880946555] [2021-12-19 20:29:46,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:46,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:46,694 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:46,698 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:46,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:46,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1805132940, now seen corresponding path program 2 times [2021-12-19 20:29:46,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:46,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063436351] [2021-12-19 20:29:46,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:46,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-19 20:29:46,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:46,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063436351] [2021-12-19 20:29:46,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063436351] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:29:46,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101110137] [2021-12-19 20:29:46,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:29:46,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:29:46,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:46,799 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) [2021-12-19 20:29:46,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2021-12-19 20:29:46,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:29:46,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:29:46,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 20:29:46,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-19 20:29:47,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:29:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-19 20:29:47,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101110137] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:29:47,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:29:47,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2021-12-19 20:29:47,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063246595] [2021-12-19 20:29:47,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:29:47,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:47,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 20:29:47,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-12-19 20:29:47,384 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. cyclomatic complexity: 27 Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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) [2021-12-19 20:29:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:47,472 INFO L93 Difference]: Finished difference Result 148 states and 191 transitions. [2021-12-19 20:29:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-19 20:29:47,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 191 transitions. [2021-12-19 20:29:47,474 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2021-12-19 20:29:47,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 146 states and 186 transitions. [2021-12-19 20:29:47,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2021-12-19 20:29:47,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2021-12-19 20:29:47,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 186 transitions. [2021-12-19 20:29:47,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:29:47,475 INFO L681 BuchiCegarLoop]: Abstraction has 146 states and 186 transitions. [2021-12-19 20:29:47,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 186 transitions. [2021-12-19 20:29:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 139. [2021-12-19 20:29:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 138 states have internal predecessors, (178), 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) [2021-12-19 20:29:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2021-12-19 20:29:47,477 INFO L704 BuchiCegarLoop]: Abstraction has 139 states and 178 transitions. [2021-12-19 20:29:47,477 INFO L587 BuchiCegarLoop]: Abstraction has 139 states and 178 transitions. [2021-12-19 20:29:47,477 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-19 20:29:47,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 178 transitions. [2021-12-19 20:29:47,478 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2021-12-19 20:29:47,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:47,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:47,478 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:47,478 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2021-12-19 20:29:47,479 INFO L791 eck$LassoCheckResult]: Stem: 4674#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4675#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 4684#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 4678#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 4670#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4671#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4683#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4700#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4672#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 4673#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 4698#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 4692#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 4693#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4696#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4704#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4705#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4697#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 4685#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4686#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 4694#L517-4 lis_~i~0#1 := 1; 4695#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4787#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4785#L521 assume !lis_#t~short11#1; 4708#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4709#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4702#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 4703#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 4689#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 4676#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4677#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4790#L521-2 [2021-12-19 20:29:47,479 INFO L793 eck$LassoCheckResult]: Loop: 4790#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4789#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4808#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4807#L521 assume !lis_#t~short11#1; 4792#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 4806#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 4805#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 4791#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 4790#L521-2 [2021-12-19 20:29:47,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2003718678, now seen corresponding path program 1 times [2021-12-19 20:29:47,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:47,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922865053] [2021-12-19 20:29:47,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:47,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:47,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:47,515 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1918160947, now seen corresponding path program 2 times [2021-12-19 20:29:47,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:47,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621931627] [2021-12-19 20:29:47,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:47,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:47,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:47,523 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:47,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash 646505654, now seen corresponding path program 2 times [2021-12-19 20:29:47,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:47,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233754087] [2021-12-19 20:29:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:47,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-19 20:29:47,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:47,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233754087] [2021-12-19 20:29:47,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233754087] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:29:47,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471253662] [2021-12-19 20:29:47,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:29:47,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:29:47,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:47,592 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) [2021-12-19 20:29:47,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2021-12-19 20:29:47,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:29:47,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:29:47,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 20:29:47,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-19 20:29:47,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:29:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-19 20:29:47,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471253662] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:29:47,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:29:47,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2021-12-19 20:29:47,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835907693] [2021-12-19 20:29:47,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:29:48,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:48,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 20:29:48,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-12-19 20:29:48,043 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. cyclomatic complexity: 46 Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 20:29:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:48,183 INFO L93 Difference]: Finished difference Result 143 states and 176 transitions. [2021-12-19 20:29:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-19 20:29:48,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 176 transitions. [2021-12-19 20:29:48,184 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:29:48,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 83 states and 106 transitions. [2021-12-19 20:29:48,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2021-12-19 20:29:48,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-12-19 20:29:48,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 106 transitions. [2021-12-19 20:29:48,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:29:48,185 INFO L681 BuchiCegarLoop]: Abstraction has 83 states and 106 transitions. [2021-12-19 20:29:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 106 transitions. [2021-12-19 20:29:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2021-12-19 20:29:48,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 81 states have internal predecessors, (105), 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) [2021-12-19 20:29:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2021-12-19 20:29:48,186 INFO L704 BuchiCegarLoop]: Abstraction has 82 states and 105 transitions. [2021-12-19 20:29:48,186 INFO L587 BuchiCegarLoop]: Abstraction has 82 states and 105 transitions. [2021-12-19 20:29:48,186 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-19 20:29:48,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 105 transitions. [2021-12-19 20:29:48,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:29:48,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:48,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:48,187 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:48,187 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-19 20:29:48,187 INFO L791 eck$LassoCheckResult]: Stem: 5213#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5214#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5222#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5217#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 5209#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5210#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5211#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5212#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5242#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5241#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5240#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5237#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5236#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5231#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 5232#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5234#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5235#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5223#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5224#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5243#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5238#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5233#L517-4 lis_~i~0#1 := 1; 5225#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5226#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5283#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5280#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5279#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5278#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5277#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5275#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5273#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5271#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5269#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5227#L520-2 [2021-12-19 20:29:48,187 INFO L793 eck$LassoCheckResult]: Loop: 5227#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5215#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5216#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5289#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5288#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5290#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5220#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5221#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5248#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5247#L521 assume !lis_#t~short11#1; 5245#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5227#L520-2 [2021-12-19 20:29:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash -217563726, now seen corresponding path program 2 times [2021-12-19 20:29:48,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:48,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44127309] [2021-12-19 20:29:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:48,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 20:29:48,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:48,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44127309] [2021-12-19 20:29:48,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44127309] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:29:48,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037086350] [2021-12-19 20:29:48,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:29:48,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:29:48,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:48,260 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) [2021-12-19 20:29:48,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2021-12-19 20:29:48,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:29:48,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:29:48,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-19 20:29:48,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 20:29:48,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:29:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 20:29:48,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037086350] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:29:48,559 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:29:48,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-19 20:29:48,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873709647] [2021-12-19 20:29:48,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:29:48,560 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:29:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1668400423, now seen corresponding path program 2 times [2021-12-19 20:29:48,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:48,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512719872] [2021-12-19 20:29:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:48,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:48,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:29:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:29:48,569 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:29:48,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:29:48,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-19 20:29:48,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-19 20:29:48,811 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. cyclomatic complexity: 27 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) [2021-12-19 20:29:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:29:48,930 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2021-12-19 20:29:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-19 20:29:48,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 99 transitions. [2021-12-19 20:29:48,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:29:48,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 99 transitions. [2021-12-19 20:29:48,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2021-12-19 20:29:48,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2021-12-19 20:29:48,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 99 transitions. [2021-12-19 20:29:48,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:29:48,931 INFO L681 BuchiCegarLoop]: Abstraction has 78 states and 99 transitions. [2021-12-19 20:29:48,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 99 transitions. [2021-12-19 20:29:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2021-12-19 20:29:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 76 states have internal predecessors, (98), 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) [2021-12-19 20:29:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2021-12-19 20:29:48,932 INFO L704 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2021-12-19 20:29:48,933 INFO L587 BuchiCegarLoop]: Abstraction has 77 states and 98 transitions. [2021-12-19 20:29:48,933 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-19 20:29:48,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 98 transitions. [2021-12-19 20:29:48,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:29:48,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:29:48,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:29:48,933 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:29:48,933 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2021-12-19 20:29:48,933 INFO L791 eck$LassoCheckResult]: Stem: 5597#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5598#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 5606#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 5601#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 5593#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5594#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5595#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5596#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5625#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5624#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5623#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 5622#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 5621#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 5613#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 5614#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5617#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5627#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5607#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5608#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5618#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5626#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 5620#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 5619#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 5615#L517-4 lis_~i~0#1 := 1; 5616#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5646#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5644#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5634#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5635#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5628#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 5629#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 5609#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 5610#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5665#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5651#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5603#L520-2 [2021-12-19 20:29:48,934 INFO L793 eck$LassoCheckResult]: Loop: 5603#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5599#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5600#L521 assume !lis_#t~short11#1; 5612#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5630#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 5631#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 5668#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 5667#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 5603#L520-2 [2021-12-19 20:29:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:29:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash -775066224, now seen corresponding path program 3 times [2021-12-19 20:29:48,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:29:48,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050793350] [2021-12-19 20:29:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:29:48,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:29:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:29:49,469 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:29:49,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:29:49,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050793350] [2021-12-19 20:29:49,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050793350] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:29:49,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737300379] [2021-12-19 20:29:49,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 20:29:49,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:29:49,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:29:49,472 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) [2021-12-19 20:29:49,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2021-12-19 20:29:49,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-19 20:29:49,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:29:49,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-19 20:29:49,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:29:49,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-12-19 20:29:49,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 18 treesize of output 18 [2021-12-19 20:29:49,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-19 20:29:49,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:29:49,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2021-12-19 20:29:49,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 [2021-12-19 20:29:49,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:29:49,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2021-12-19 20:29:49,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 30 [2021-12-19 20:29:49,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:29:49,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:29:49,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:29:49,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-12-19 20:29:49,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2021-12-19 20:29:50,170 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:29:50,170 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 13 [2021-12-19 20:29:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-19 20:29:50,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:29:50,407 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1330 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_1330)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (<= |c_ULTIMATE.start_lis_~i~0#1| 1)) is different from false [2021-12-19 20:29:50,421 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_209| Int)) (or (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1330 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_209| 4)) v_ArrVal_1330)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (<= |v_ULTIMATE.start_lis_~i~0#1_209| 1) (< |v_ULTIMATE.start_lis_~i~0#1_209| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2021-12-19 20:29:52,060 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 Int) (|v_ULTIMATE.start_lis_~i~0#1_209| Int)) (or (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1325))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_209| 4)) v_ArrVal_1330))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (<= |v_ULTIMATE.start_lis_~i~0#1_209| 1) (< |v_ULTIMATE.start_lis_~i~0#1_209| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2021-12-19 20:29:52,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 Int) (|v_ULTIMATE.start_lis_~i~0#1_209| Int)) (or (<= |v_ULTIMATE.start_lis_~i~0#1_209| 1) (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1325))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_209| 4)) v_ArrVal_1330))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_209| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)))) is different from false [2021-12-19 20:29:52,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (|v_ULTIMATE.start_lis_~i~0#1_209| Int)) (or (let ((.cse0 (select (store (let ((.cse1 (store (let ((.cse3 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3) v_ArrVal_1322)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1321))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3 4) 1)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1325))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_209| 4)) v_ArrVal_1330))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (<= |v_ULTIMATE.start_lis_~i~0#1_209| 1) (< |v_ULTIMATE.start_lis_~i~0#1_209| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)))) is different from false [2021-12-19 20:29:52,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 Int) (v_ArrVal_1321 (Array Int Int)) (v_ArrVal_1322 Int) (|v_ULTIMATE.start_lis_~i~0#1_209| Int)) (or (< |v_ULTIMATE.start_lis_~i~0#1_209| (+ |c_ULTIMATE.start_lis_~i~0#1| 3)) (let ((.cse0 (select (store (let ((.cse1 (store (let ((.cse3 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3 4) v_ArrVal_1322)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1321))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3 8) 1)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1325))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_209| 4)) v_ArrVal_1330))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (<= |v_ULTIMATE.start_lis_~i~0#1_209| 1))) is different from false [2021-12-19 20:29:52,119 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:29:52,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 477 treesize of output 298 [2021-12-19 20:29:52,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 549 treesize of output 543 [2021-12-19 20:29:52,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:29:52,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:29:52,149 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:29:52,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 3632 treesize of output 3524 [2021-12-19 20:29:52,284 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-19 20:29:52,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2555 treesize of output 2507 [2021-12-19 20:29:52,302 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-19 20:29:52,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2759 treesize of output 2711 [2021-12-19 20:29:52,358 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-19 20:29:52,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 4101 treesize of output 4005 [2021-12-19 20:29:52,488 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-19 20:29:52,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13166 treesize of output 12782 [2021-12-19 20:30:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 15 not checked. [2021-12-19 20:30:14,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737300379] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:30:14,567 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:30:14,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 15] total 45 [2021-12-19 20:30:14,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208412589] [2021-12-19 20:30:14,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:30:14,568 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:30:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1231419467, now seen corresponding path program 3 times [2021-12-19 20:30:14,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:30:14,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758305317] [2021-12-19 20:30:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:30:14,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:30:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:14,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:30:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:14,576 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:30:14,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:30:14,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-19 20:30:14,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1372, Unknown=6, NotChecked=486, Total=2070 [2021-12-19 20:30:14,714 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. cyclomatic complexity: 25 Second operand has 46 states, 45 states have (on average 1.8) internal successors, (81), 46 states have internal predecessors, (81), 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) [2021-12-19 20:30:15,768 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse4 (+ .cse0 12)) (.cse3 (* 4 |c_ULTIMATE.start_lis_~N#1|))) (and (= |c_ULTIMATE.start_lis_~i~0#1| 1) (not (= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse0) 0)) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2)) 1) (or (= .cse3 16) (< .cse4 .cse3)) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~array_size~0#1|) (<= 1 (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (- 4)))) (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (= (select .cse1 0) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~numbers~0#1.base|) 1) (= |c_ULTIMATE.start_main_~numbers~0#1.offset| 0) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 Int) (|v_ULTIMATE.start_lis_~i~0#1_209| Int)) (or (<= |v_ULTIMATE.start_lis_~i~0#1_209| 1) (let ((.cse5 (select (store (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1325))) (store .cse6 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse6 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_209| 4)) v_ArrVal_1330))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse5 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse5 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_209| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)))) (<= .cse4 .cse3) (<= (+ (div (* |c_ULTIMATE.start_lis_~best~0#1.offset| (- 1)) 4) 4) |c_ULTIMATE.start_lis_~N#1|) (<= 12 (* 4 |c_ULTIMATE.start_main_~i~1#1|))))) is different from false [2021-12-19 20:30:16,300 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|))) (and (<= 1 (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) (- 8)))) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (or (and (= (select .cse0 0) 1) (<= (+ (div (* |c_ULTIMATE.start_lis_~best~0#1.offset| (- 1)) 4) 4) |c_ULTIMATE.start_lis_~N#1|) (let ((.cse1 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (or (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 9) (* 4 |c_ULTIMATE.start_lis_~N#1|)) (= 8 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1))))) (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~N#1|)) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 Int) (|v_ULTIMATE.start_lis_~i~0#1_209| Int)) (or (let ((.cse2 (select (store (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1325))) (store .cse3 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse3 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_209| 4)) v_ArrVal_1330))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse2 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (<= |v_ULTIMATE.start_lis_~i~0#1_209| 1) (< |v_ULTIMATE.start_lis_~i~0#1_209| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (= |c_ULTIMATE.start_lis_~i~0#1| 2) (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)))) is different from false [2021-12-19 20:30:28,304 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse3 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse2 (= (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3)) 1))) (and (or (and (= (select .cse0 0) 1) (let ((.cse1 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (or (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 9) (* 4 |c_ULTIMATE.start_lis_~N#1|)) (and .cse2 (= 8 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1))))) (<= (+ (div (* |c_ULTIMATE.start_lis_~best~0#1.offset| (- 1)) 4) 4) |c_ULTIMATE.start_lis_~N#1|)) (<= (+ |c_ULTIMATE.start_lis_~i~0#1| 4) |c_ULTIMATE.start_lis_~N#1|)) (<= 1 (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3 (- 8)))) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) .cse2 (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (forall ((|v_ULTIMATE.start_lis_~i~0#1_209| Int)) (or (forall ((v_ArrVal_1328 (Array Int Int)) (v_ArrVal_1330 Int)) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_209| 4)) v_ArrVal_1330)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1328) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse4 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8)) (+ (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (<= |v_ULTIMATE.start_lis_~i~0#1_209| 1) (< |v_ULTIMATE.start_lis_~i~0#1_209| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (= |c_ULTIMATE.start_lis_~i~0#1| 2) (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|))))) is different from false [2021-12-19 20:30:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:30:29,158 INFO L93 Difference]: Finished difference Result 157 states and 200 transitions. [2021-12-19 20:30:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-19 20:30:29,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 200 transitions. [2021-12-19 20:30:29,159 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 60 [2021-12-19 20:30:29,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 157 states and 200 transitions. [2021-12-19 20:30:29,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2021-12-19 20:30:29,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2021-12-19 20:30:29,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 200 transitions. [2021-12-19 20:30:29,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:30:29,160 INFO L681 BuchiCegarLoop]: Abstraction has 157 states and 200 transitions. [2021-12-19 20:30:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 200 transitions. [2021-12-19 20:30:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 76. [2021-12-19 20:30:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.25) internal successors, (95), 75 states have internal predecessors, (95), 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) [2021-12-19 20:30:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2021-12-19 20:30:29,161 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 95 transitions. [2021-12-19 20:30:29,161 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 95 transitions. [2021-12-19 20:30:29,161 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-19 20:30:29,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 95 transitions. [2021-12-19 20:30:29,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:30:29,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:30:29,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:30:29,162 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:30:29,162 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1] [2021-12-19 20:30:29,162 INFO L791 eck$LassoCheckResult]: Stem: 6128#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6129#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6137#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6132#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 6124#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6125#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6126#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6127#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6154#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6153#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6152#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6151#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6150#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6143#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 6144#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6147#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6156#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6138#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6139#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6157#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6148#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6149#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6155#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6145#L517-4 lis_~i~0#1 := 1; 6146#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6175#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6173#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6164#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6165#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6196#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6135#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6136#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6140#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6199#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6182#L521-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6189#L520-2 [2021-12-19 20:30:29,162 INFO L793 eck$LassoCheckResult]: Loop: 6189#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6170#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6167#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6168#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6172#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6171#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6159#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6194#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6193#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6192#L521 assume !lis_#t~short11#1; 6190#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6189#L520-2 [2021-12-19 20:30:29,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash -775066226, now seen corresponding path program 2 times [2021-12-19 20:30:29,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:30:29,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311468566] [2021-12-19 20:30:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:30:29,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:30:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:30:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 20:30:29,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:30:29,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311468566] [2021-12-19 20:30:29,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311468566] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:30:29,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436574006] [2021-12-19 20:30:29,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 20:30:29,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:30:29,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:29,795 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) [2021-12-19 20:30:29,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-12-19 20:30:29,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 20:30:29,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:30:29,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-19 20:30:29,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:30:29,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-12-19 20:30:29,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 18 treesize of output 18 [2021-12-19 20:30:29,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-19 20:30:30,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:30,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2021-12-19 20:30:30,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 30 [2021-12-19 20:30:30,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:30,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:30,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:30,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-12-19 20:30:30,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 34 [2021-12-19 20:30:37,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:37,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:37,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:37,430 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:30:37,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2021-12-19 20:30:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-19 20:30:37,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:30:37,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_222| Int)) (or (forall ((v_ArrVal_1430 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_222| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1430) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (or (<= .cse0 (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) .cse0))))) (< |v_ULTIMATE.start_lis_~i~0#1_222| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2021-12-19 20:30:37,799 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_222| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_222| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1430) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (or (<= .cse0 (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8))) (< |v_ULTIMATE.start_lis_~i~0#1_222| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) .cse0))))) is different from false [2021-12-19 20:30:37,819 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_222| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_222| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1430) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (or (< |v_ULTIMATE.start_lis_~i~0#1_222| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)) (<= .cse0 (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) .cse0))))) is different from false [2021-12-19 20:30:37,830 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:30:37,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 459 treesize of output 279 [2021-12-19 20:30:37,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 510 treesize of output 500 [2021-12-19 20:30:37,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:37,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:37,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:37,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 656 [2021-12-19 20:30:37,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:37,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:37,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:37,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 686 treesize of output 638 [2021-12-19 20:30:37,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:37,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:37,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:37,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 852 treesize of output 804 [2021-12-19 20:30:37,919 INFO L354 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2021-12-19 20:30:37,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 709 treesize of output 685 [2021-12-19 20:30:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 9 not checked. [2021-12-19 20:30:39,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436574006] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 20:30:39,261 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-19 20:30:39,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15, 15] total 51 [2021-12-19 20:30:39,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153871948] [2021-12-19 20:30:39,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-19 20:30:39,261 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 20:30:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1668400423, now seen corresponding path program 3 times [2021-12-19 20:30:39,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:30:39,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386908662] [2021-12-19 20:30:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:30:39,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:30:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:39,271 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 20:30:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 20:30:39,275 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 20:30:39,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 20:30:39,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-19 20:30:39,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2131, Unknown=7, NotChecked=288, Total=2652 [2021-12-19 20:30:39,486 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. cyclomatic complexity: 23 Second operand has 52 states, 51 states have (on average 1.607843137254902) internal successors, (82), 52 states have internal predecessors, (82), 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) [2021-12-19 20:30:40,329 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4))))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_222| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_222| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1430) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (or (< |v_ULTIMATE.start_lis_~i~0#1_222| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)) (<= .cse0 (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8))) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) .cse0))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~numbers~0#1.base|) 1) (= |c_ULTIMATE.start_lis_~i~0#1| 1) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (= |c_ULTIMATE.start_main_~numbers~0#1.offset| 0) (let ((.cse3 (* 4 |c_ULTIMATE.start_main_~array_size~0#1|))) (or (< 16 .cse3) (= .cse3 16))) (<= .cse4 1) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (let ((.cse6 (* 4 |c_ULTIMATE.start_lis_~i~0#1|)) (.cse5 (* 4 |c_ULTIMATE.start_lis_~N#1|))) (or (and (= .cse4 1) (= .cse5 16) (= 4 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse6))) (< (+ .cse6 12) .cse5))) (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (<= 12 (* 4 |c_ULTIMATE.start_main_~i~1#1|)))) is different from false [2021-12-19 20:30:40,932 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse6 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (let ((.cse4 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse6)) (.cse5 (= (select .cse3 4) 1)) (.cse7 (* 4 |c_ULTIMATE.start_lis_~N#1|))) (and (forall ((v_ArrVal_1427 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_222| Int) (v_ArrVal_1430 (Array Int Int))) (let ((.cse1 (select (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_222| 4)) 1))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1430) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse0 (+ (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (or (<= .cse0 (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8))) (< |v_ULTIMATE.start_lis_~i~0#1_222| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)) (< (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) .cse0))))) (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (<= (select .cse3 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) (- 4))) 1) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (or (and (= 8 .cse4) .cse5) (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse6 9) .cse7)) (= |c_ULTIMATE.start_lis_~i~0#1| 2) (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (or (and (= (select .cse3 8) 1) (not (= .cse4 4)) (not (= .cse4 8)) .cse5) (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse6 5) .cse7))))) is different from false [2021-12-19 20:30:41,433 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse2 (* |c_ULTIMATE.start_lis_~i~0#1| 4))) (let ((.cse0 (= (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2)) 1))) (and .cse0 (not (= |c_ULTIMATE.start_lis_~best~0#1.base| |c_ULTIMATE.start_lis_~prev~0#1.base|)) (<= (select .cse1 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (- 4))) 1) (= |c_ULTIMATE.start_lis_~best~0#1.offset| 0) (forall ((|v_ULTIMATE.start_lis_~i~0#1_222| Int)) (or (forall ((v_ArrVal_1430 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_222| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1430) |c_ULTIMATE.start_lis_~best~0#1.base|))) (let ((.cse3 (+ (select .cse4 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (or (<= .cse3 (select .cse4 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 8))) (< (select .cse4 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) .cse3))))) (< |v_ULTIMATE.start_lis_~i~0#1_222| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) (= |c_ULTIMATE.start_lis_~i~0#1| 2) (not (= |c_ULTIMATE.start_lis_~prev~0#1.base| |c_ULTIMATE.start_lis_~best~0#1.base|)) (let ((.cse5 (* 4 |c_ULTIMATE.start_lis_~i~0#1|))) (or (<= (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse5 9) (* 4 |c_ULTIMATE.start_lis_~N#1|)) (and .cse0 (= 8 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| .cse5)) (= (select .cse1 4) 1))))))) is different from false [2021-12-19 20:30:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 20:30:46,128 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2021-12-19 20:30:46,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-19 20:30:46,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 137 transitions. [2021-12-19 20:30:46,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:30:46,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 110 states and 135 transitions. [2021-12-19 20:30:46,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-12-19 20:30:46,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-12-19 20:30:46,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 135 transitions. [2021-12-19 20:30:46,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 20:30:46,130 INFO L681 BuchiCegarLoop]: Abstraction has 110 states and 135 transitions. [2021-12-19 20:30:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 135 transitions. [2021-12-19 20:30:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2021-12-19 20:30:46,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 90 states have internal predecessors, (114), 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) [2021-12-19 20:30:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2021-12-19 20:30:46,131 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 114 transitions. [2021-12-19 20:30:46,131 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 114 transitions. [2021-12-19 20:30:46,131 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-19 20:30:46,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 114 transitions. [2021-12-19 20:30:46,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2021-12-19 20:30:46,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 20:30:46,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 20:30:46,133 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 20:30:46,133 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2021-12-19 20:30:46,133 INFO L791 eck$LassoCheckResult]: Stem: 6613#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6614#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~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6623#L530 assume !(main_~array_size~0#1 < 1 || main_~array_size~0#1 % 4294967296 >= 536870911); 6617#L530-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);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; 6609#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6610#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6611#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6612#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6620#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6639#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6638#L535-3 assume !!(main_~i~1#1 < main_~array_size~0#1);call write~int(main_#t~nondet19#1, main_~numbers~0#1.base, main_~numbers~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet19#1; 6637#L535-2 main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post18#1;havoc main_#t~post18#1; 6636#L535-3 assume !(main_~i~1#1 < main_~array_size~0#1); 6629#L535-4 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~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#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);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);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; 6630#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6633#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6634#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6635#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6643#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6645#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6644#L517-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 6624#L517-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 6625#L517-3 assume !(lis_~i~0#1 < lis_~N#1); 6640#L517-4 lis_~i~0#1 := 1; 6669#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6668#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6666#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6664#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6661#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6642#L520-3 assume !(lis_~j~0#1 < lis_~i~0#1); 6621#L519-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 6622#L519-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 6615#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6616#L521 assume !lis_#t~short11#1; 6628#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6648#L520-2 [2021-12-19 20:30:46,133 INFO L793 eck$LassoCheckResult]: Loop: 6648#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6690#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6657#L521 assume !lis_#t~short11#1; 6683#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6686#L520-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 6685#L520-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 6682#L521 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 6679#L521-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 6648#L520-2 [2021-12-19 20:30:46,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 20:30:46,133 INFO L85 PathProgramCache]: Analyzing trace with hash -775066162, now seen corresponding path program 3 times [2021-12-19 20:30:46,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 20:30:46,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883110725] [2021-12-19 20:30:46,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 20:30:46,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 20:30:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 20:30:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-19 20:30:46,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 20:30:46,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883110725] [2021-12-19 20:30:46,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883110725] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 20:30:46,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068998898] [2021-12-19 20:30:46,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 20:30:46,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 20:30:46,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 20:30:46,652 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) [2021-12-19 20:30:46,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-12-19 20:30:46,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-19 20:30:46,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 20:30:46,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-19 20:30:46,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 20:30:46,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2021-12-19 20:30:46,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 18 treesize of output 18 [2021-12-19 20:30:46,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-19 20:30:46,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:46,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-19 20:30:46,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2021-12-19 20:30:46,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:46,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:46,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:46,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-12-19 20:30:46,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2021-12-19 20:30:47,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 20:30:47,022 INFO L354 Elim1Store]: treesize reduction 42, result has 40.8 percent of original size [2021-12-19 20:30:47,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 52 [2021-12-19 20:30:47,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 35 [2021-12-19 20:30:47,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,284 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:30:47,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 29 [2021-12-19 20:30:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-19 20:30:47,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 20:30:47,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_lis_~i~0#1| Int)) (or (forall ((v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1525 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_1525)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1)))) (<= |ULTIMATE.start_lis_~i~0#1| 1))) is different from false [2021-12-19 20:30:47,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_236| Int) (v_ArrVal_1523 Int) (v_ArrVal_1525 Int)) (or (<= |v_ULTIMATE.start_lis_~i~0#1_236| 1) (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) v_ArrVal_1523)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1521))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_236| 4)) v_ArrVal_1525))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) is different from false [2021-12-19 20:30:47,662 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_237| Int)) (or (forall ((v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_236| Int) (v_ArrVal_1523 Int) (v_ArrVal_1525 Int)) (or (<= |v_ULTIMATE.start_lis_~i~0#1_236| 1) (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_237| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1523)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1521))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_236| 4)) v_ArrVal_1525))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) (< |v_ULTIMATE.start_lis_~i~0#1_237| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2021-12-19 20:30:47,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_237| Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_236| Int) (v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1519 (Array Int Int))) (or (<= |v_ULTIMATE.start_lis_~i~0#1_236| 1) (let ((.cse0 (select (store (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4)) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1519))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_237| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1523))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1521))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_236| 4)) v_ArrVal_1525))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))) (< |v_ULTIMATE.start_lis_~i~0#1_237| (+ |c_ULTIMATE.start_lis_~i~0#1| 1)))) is different from false [2021-12-19 20:30:47,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_lis_~i~0#1_237| Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1521 (Array Int Int)) (|v_ULTIMATE.start_lis_~i~0#1_236| Int) (v_ArrVal_1523 Int) (v_ArrVal_1525 Int) (v_ArrVal_1519 (Array Int Int))) (or (< |v_ULTIMATE.start_lis_~i~0#1_237| (+ |c_ULTIMATE.start_lis_~i~0#1| 2)) (<= |v_ULTIMATE.start_lis_~i~0#1_236| 1) (let ((.cse0 (select (store (let ((.cse1 (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |c_ULTIMATE.start_lis_~i~0#1| 4) 4) 1)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1519))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ (* |v_ULTIMATE.start_lis_~i~0#1_237| 4) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1523))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1521))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (+ |c_ULTIMATE.start_lis_~best~0#1.offset| (* |v_ULTIMATE.start_lis_~i~0#1_236| 4)) v_ArrVal_1525))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1524) |c_ULTIMATE.start_lis_~best~0#1.base|))) (< (select .cse0 (+ |c_ULTIMATE.start_lis_~best~0#1.offset| 4)) (+ (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|) 1))))) is different from false [2021-12-19 20:30:47,734 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-19 20:30:47,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 473 treesize of output 294 [2021-12-19 20:30:47,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 542 treesize of output 536 [2021-12-19 20:30:47,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 1009 treesize of output 961 [2021-12-19 20:30:47,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 929 treesize of output 881 [2021-12-19 20:30:47,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 825 treesize of output 801 [2021-12-19 20:30:47,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 20:30:47,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 899 treesize of output 875 [2021-12-19 20:30:47,839 INFO L354 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2021-12-19 20:30:47,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25399 treesize of output 24645 Killed by 15