./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer --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 64bit --witnessprinter.graph.data.programhash 8104a25549f6efe413528ca8cc098e1acad610e4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:17,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:17,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:17,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:17,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:17,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:17,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:17,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:17,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:17,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:17,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:17,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:17,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:17,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:17,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:17,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:17,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:17,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:17,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:17,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:17,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:17,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:17,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:17,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:17,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:17,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:17,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:17,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:17,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:17,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:17,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:17,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:17,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:17,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:17,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:17,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:17,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:17,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:17,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:17,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:17,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:17,586 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:57:17,603 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:17,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:17,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:17,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:17,604 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:17,604 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:17,605 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:17,605 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:17,605 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:17,605 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:17,605 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:17,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:17,606 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:17,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:17,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:17,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:17,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:17,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:17,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:17,611 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:17,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:17,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:17,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:17,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:17,611 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:17,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:17,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:17,612 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:17,613 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:17,613 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8104a25549f6efe413528ca8cc098e1acad610e4 [2019-10-22 08:57:17,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:17,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:17,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:17,668 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:17,669 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:17,669 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2019-10-22 08:57:17,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/data/3dad9eab8/807e3eeb6b7f4aafa93475d0d75890d5/FLAGd101ee010 [2019-10-22 08:57:18,129 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:18,129 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2019-10-22 08:57:18,141 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/data/3dad9eab8/807e3eeb6b7f4aafa93475d0d75890d5/FLAGd101ee010 [2019-10-22 08:57:18,151 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/data/3dad9eab8/807e3eeb6b7f4aafa93475d0d75890d5 [2019-10-22 08:57:18,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:18,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:18,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:18,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:18,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:18,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7dd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18, skipping insertion in model container [2019-10-22 08:57:18,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,170 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:18,202 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:18,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:18,531 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:18,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:18,622 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:18,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18 WrapperNode [2019-10-22 08:57:18,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:18,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:18,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:18,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:18,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:18,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:18,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:18,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:18,670 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... [2019-10-22 08:57:18,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:18,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:18,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:18,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:18,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3bca25c7-d99e-42c0-b4fb-fbf42392ff18/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:18,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:19,029 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:19,029 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:57:19,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:19 BoogieIcfgContainer [2019-10-22 08:57:19,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:19,031 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:19,031 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:19,035 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:19,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:19,047 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:18" (1/3) ... [2019-10-22 08:57:19,048 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d672259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:19, skipping insertion in model container [2019-10-22 08:57:19,048 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:19,048 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:18" (2/3) ... [2019-10-22 08:57:19,049 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d672259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:19, skipping insertion in model container [2019-10-22 08:57:19,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:19,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:19" (3/3) ... [2019-10-22 08:57:19,051 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2019-10-22 08:57:19,125 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:19,125 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:19,126 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:19,126 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:19,126 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:19,126 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:19,126 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:19,126 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:19,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:57:19,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:19,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:19,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:19,179 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:57:19,180 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:19,180 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:19,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-10-22 08:57:19,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:19,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:19,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:19,183 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:57:19,184 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:19,192 INFO L791 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 16#L560true assume !(main_~array_size~0 < 1); 5#L560-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 6#L550-3true [2019-10-22 08:57:19,193 INFO L793 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 8#L553-6true assume !true; 9#L553-7true call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 3#L550-2true insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 6#L550-3true [2019-10-22 08:57:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-10-22 08:57:19,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:19,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788864341] [2019-10-22 08:57:19,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:19,337 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:19,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2019-10-22 08:57:19,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:19,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476838186] [2019-10-22 08:57:19,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:19,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476838186] [2019-10-22 08:57:19,371 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:19,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:57:19,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637541219] [2019-10-22 08:57:19,377 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:57:19,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:19,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:57:19,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:57:19,396 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-10-22 08:57:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:19,404 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-10-22 08:57:19,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:57:19,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-10-22 08:57:19,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:19,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2019-10-22 08:57:19,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:57:19,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 08:57:19,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-10-22 08:57:19,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:19,415 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:57:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-10-22 08:57:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 08:57:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 08:57:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-10-22 08:57:19,437 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:57:19,437 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-10-22 08:57:19,437 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:19,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-10-22 08:57:19,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:57:19,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:19,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:19,439 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:57:19,439 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:57:19,439 INFO L791 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 43#L560 assume !(main_~array_size~0 < 1); 44#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 41#L550-3 [2019-10-22 08:57:19,439 INFO L793 eck$LassoCheckResult]: Loop: 41#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 39#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 46#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 47#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 48#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 40#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 41#L550-3 [2019-10-22 08:57:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:19,440 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-10-22 08:57:19,440 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:19,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036002134] [2019-10-22 08:57:19,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:19,460 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2019-10-22 08:57:19,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:19,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408211343] [2019-10-22 08:57:19,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:19,497 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2019-10-22 08:57:19,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:19,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612902712] [2019-10-22 08:57:19,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:19,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:19,556 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:19,723 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-10-22 08:57:19,946 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:19,947 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:19,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:19,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:19,949 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:19,949 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:19,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:19,950 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:19,950 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2019-10-22 08:57:19,950 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:19,951 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:19,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:19,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:19,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:19,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:19,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:20,575 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:20,582 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:20,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,586 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,587 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:20,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,591 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:20,591 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:20,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,597 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:20,597 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,597 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,597 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:20,598 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:20,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,600 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:20,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,601 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:20,601 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:20,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,605 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,607 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:20,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,608 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:20,609 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:20,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,612 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,615 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:20,617 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:20,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,625 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:20,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,626 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:20,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:20,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,628 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,630 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:20,630 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:20,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,637 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,637 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,638 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:20,639 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:20,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:20,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,644 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:20,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:20,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,649 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:20,649 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:20,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:20,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:20,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,676 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:20,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,676 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,679 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:20,679 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:20,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,716 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:20,716 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:20,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,726 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:20,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,727 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:20,728 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:20,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,735 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:20,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,736 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:20,736 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:20,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:20,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:20,739 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:20,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:20,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:20,739 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:20,745 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:20,748 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:20,824 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:20,895 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:57:20,895 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:20,897 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:20,899 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:20,900 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:20,900 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2019-10-22 08:57:20,918 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:57:20,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:20,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:20,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:20,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:20,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:20,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:21,003 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 [2019-10-22 08:57:21,004 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-10-22 08:57:21,034 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 19 states and 25 transitions. Complement of second has 4 states. [2019-10-22 08:57:21,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:57:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-10-22 08:57:21,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-10-22 08:57:21,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:21,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:57:21,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:21,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-10-22 08:57:21,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:21,040 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2019-10-22 08:57:21,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:21,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2019-10-22 08:57:21,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:57:21,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:57:21,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-10-22 08:57:21,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:21,043 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 08:57:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-10-22 08:57:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-10-22 08:57:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:57:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-10-22 08:57:21,045 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:57:21,045 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-10-22 08:57:21,046 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:21,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-10-22 08:57:21,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:21,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:21,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:21,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:21,048 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:21,048 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 141#L560 assume !(main_~array_size~0 < 1); 142#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 143#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 135#L553-6 [2019-10-22 08:57:21,048 INFO L793 eck$LassoCheckResult]: Loop: 135#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 144#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 147#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 134#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 135#L553-6 [2019-10-22 08:57:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,048 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-10-22 08:57:21,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:21,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317507324] [2019-10-22 08:57:21,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:21,070 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 1 times [2019-10-22 08:57:21,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:21,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793158554] [2019-10-22 08:57:21,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:21,098 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:21,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1185710257, now seen corresponding path program 1 times [2019-10-22 08:57:21,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:21,101 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829144392] [2019-10-22 08:57:21,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:21,136 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:21,370 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-10-22 08:57:21,424 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:21,424 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:21,424 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:21,424 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:21,424 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:21,424 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:21,424 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:21,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:21,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration3_Lasso [2019-10-22 08:57:21,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:21,427 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:21,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:21,903 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:21,904 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:21,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:21,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,905 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,909 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:21,909 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:21,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:21,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:21,922 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:21,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:21,923 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:21,923 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:21,925 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:21,925 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:21,967 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:21,995 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:21,995 INFO L444 ModelExtractionUtils]: 34 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:21,995 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:21,996 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:21,997 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:21,997 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-10-22 08:57:22,005 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 08:57:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:22,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:22,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:22,072 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 [2019-10-22 08:57:22,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:57:22,124 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 47 states and 62 transitions. Complement of second has 9 states. [2019-10-22 08:57:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-10-22 08:57:22,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:57:22,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:22,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 08:57:22,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:22,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 08:57:22,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:22,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 62 transitions. [2019-10-22 08:57:22,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:22,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 30 states and 40 transitions. [2019-10-22 08:57:22,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:57:22,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:57:22,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-10-22 08:57:22,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:22,132 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-22 08:57:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-10-22 08:57:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-10-22 08:57:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:57:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2019-10-22 08:57:22,136 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-10-22 08:57:22,136 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-10-22 08:57:22,136 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:22,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2019-10-22 08:57:22,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:22,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:22,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:22,137 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:22,137 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:22,138 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 274#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 275#L560 assume !(main_~array_size~0 < 1); 276#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 277#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 271#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 283#L553-1 assume !insertionSort_#t~short6; 284#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 285#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 272#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 273#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 269#L553-6 [2019-10-22 08:57:22,138 INFO L793 eck$LassoCheckResult]: Loop: 269#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 278#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 282#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 268#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 269#L553-6 [2019-10-22 08:57:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2019-10-22 08:57:22,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848163683] [2019-10-22 08:57:22,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:22,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848163683] [2019-10-22 08:57:22,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:22,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:22,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784859149] [2019-10-22 08:57:22,191 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:57:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2019-10-22 08:57:22,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280150683] [2019-10-22 08:57:22,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,200 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:22,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:22,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:22,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:22,290 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-10-22 08:57:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:22,359 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-22 08:57:22,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:22,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2019-10-22 08:57:22,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:22,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2019-10-22 08:57:22,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-10-22 08:57:22,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:57:22,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2019-10-22 08:57:22,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:22,363 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-10-22 08:57:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2019-10-22 08:57:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2019-10-22 08:57:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:57:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-10-22 08:57:22,365 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 08:57:22,365 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-10-22 08:57:22,365 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:57:22,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-10-22 08:57:22,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:57:22,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:22,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:22,367 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:22,367 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:22,367 INFO L791 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 341#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 342#L560 assume !(main_~array_size~0 < 1); 343#L560-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 344#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 346#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 347#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 352#L553-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5; 353#L553-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 339#L550-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 340#L550-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 336#L553-6 [2019-10-22 08:57:22,367 INFO L793 eck$LassoCheckResult]: Loop: 336#L553-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 345#L553-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 351#L553-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~short6;havoc insertionSort_#t~mem5;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 335#L553-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 336#L553-6 [2019-10-22 08:57:22,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2019-10-22 08:57:22,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549863643] [2019-10-22 08:57:22,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,389 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 3 times [2019-10-22 08:57:22,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874910686] [2019-10-22 08:57:22,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,390 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,397 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:22,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2019-10-22 08:57:22,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914496315] [2019-10-22 08:57:22,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:22,426 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:22,780 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 90 [2019-10-22 08:57:22,844 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:22,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:22,845 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:22,845 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:22,845 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:22,845 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:22,845 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:22,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:22,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2019-10-22 08:57:22,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:22,845 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:22,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:22,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:57:23,305 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:23,305 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:23,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:23,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:23,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:23,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:23,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:23,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:23,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:23,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:23,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:23,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:23,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:23,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:23,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:23,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:23,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:23,309 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:23,309 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:23,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:23,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:23,311 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:23,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:23,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:23,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:23,312 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:23,312 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:23,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:23,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:23,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:23,317 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:57:23,317 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:23,317 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:23,319 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:57:23,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:23,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:23,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:23,325 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:23,326 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:23,326 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:23,326 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:23,327 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:23,327 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:23,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:23,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:57:23,333 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:23,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:23,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:23,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:23,336 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:23,336 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:23,369 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:23,376 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:57:23,377 INFO L444 ModelExtractionUtils]: 34 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:57:23,377 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:23,378 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:23,378 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:23,378 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2019-10-22 08:57:23,401 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-10-22 08:57:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:23,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:23,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,467 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 [2019-10-22 08:57:23,467 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-10-22 08:57:23,515 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-10-22 08:57:23,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-10-22 08:57:23,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 08:57:23,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:23,519 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:23,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:23,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,637 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:57:23,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-10-22 08:57:23,680 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2019-10-22 08:57:23,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-10-22 08:57:23,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 08:57:23,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:23,681 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:57:23,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:23,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 08:57:23,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:23,738 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:57:23,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-10-22 08:57:23,789 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 8 states. [2019-10-22 08:57:23,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:57:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-10-22 08:57:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 08:57:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 08:57:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 8 letters. [2019-10-22 08:57:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:23,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2019-10-22 08:57:23,795 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:23,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 0 states and 0 transitions. [2019-10-22 08:57:23,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:57:23,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:57:23,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:57:23,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:57:23,797 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:23,797 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:23,797 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:23,797 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:57:23,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:23,798 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:57:23,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:57:23,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:57:23 BoogieIcfgContainer [2019-10-22 08:57:23,803 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:57:23,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:23,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:23,804 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:23,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:19" (3/4) ... [2019-10-22 08:57:23,808 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:57:23,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:23,811 INFO L168 Benchmark]: Toolchain (without parser) took 5656.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 938.0 MB in the beginning and 992.2 MB in the end (delta: -54.2 MB). Peak memory consumption was 139.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,812 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:23,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:23,815 INFO L168 Benchmark]: Boogie Preprocessor took 23.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,815 INFO L168 Benchmark]: RCFGBuilder took 344.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,816 INFO L168 Benchmark]: BuchiAutomizer took 4772.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 108.8 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:23,816 INFO L168 Benchmark]: Witness Printer took 6.26 ms. Allocated memory is still 1.2 GB. Free memory is still 992.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:23,819 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -186.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 344.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4772.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.0 MB). Free memory was 1.1 GB in the beginning and 992.2 MB in the end (delta: 108.8 MB). Peak memory consumption was 161.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.26 ms. Allocated memory is still 1.2 GB. Free memory is still 992.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One deterministic module has affine ranking function j and consists of 5 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 116 SDslu, 43 SDs, 0 SdLazy, 130 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital166 mio100 ax110 hnf99 lsp86 ukn77 mio100 lsp64 div100 bol100 ite100 ukn100 eq180 hnf82 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...