./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/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 647da5540d24322bf98da85423c1800dc68ed16f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:47:29,672 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:47:29,674 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:47:29,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:47:29,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:47:29,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:47:29,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:47:29,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:47:29,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:47:29,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:47:29,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:47:29,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:47:29,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:47:29,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:47:29,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:47:29,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:47:29,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:47:29,688 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:47:29,689 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:47:29,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:47:29,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:47:29,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:47:29,692 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:47:29,692 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:47:29,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:47:29,693 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:47:29,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:47:29,695 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:47:29,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:47:29,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:47:29,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:47:29,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:47:29,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:47:29,697 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:47:29,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:47:29,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:47:29,698 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 03:47:29,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:47:29,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:47:29,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:47:29,707 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:47:29,707 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:47:29,707 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:47:29,708 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:47:29,708 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:47:29,708 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:47:29,708 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:47:29,708 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:47:29,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:47:29,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:47:29,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:47:29,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:47:29,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:47:29,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:47:29,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:47:29,709 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:47:29,709 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:47:29,709 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:47:29,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:47:29,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:47:29,710 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:47:29,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:47:29,710 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:47:29,710 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:47:29,711 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:47:29,711 INFO L133 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_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/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 -> 647da5540d24322bf98da85423c1800dc68ed16f [2018-11-10 03:47:29,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:47:29,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:47:29,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:47:29,746 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:47:29,747 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:47:29,747 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-10 03:47:29,791 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/data/7c96e8389/626b17cc977c4c23b4a75e70f5e9b32d/FLAG42416fe65 [2018-11-10 03:47:30,194 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:47:30,194 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-10 03:47:30,198 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/data/7c96e8389/626b17cc977c4c23b4a75e70f5e9b32d/FLAG42416fe65 [2018-11-10 03:47:30,209 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/data/7c96e8389/626b17cc977c4c23b4a75e70f5e9b32d [2018-11-10 03:47:30,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:47:30,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:47:30,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:47:30,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:47:30,216 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:47:30,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e7208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30, skipping insertion in model container [2018-11-10 03:47:30,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:47:30,244 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:47:30,350 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:47:30,356 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:47:30,367 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:47:30,377 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:47:30,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30 WrapperNode [2018-11-10 03:47:30,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:47:30,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:47:30,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:47:30,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:47:30,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:47:30,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:47:30,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:47:30,401 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:47:30,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... [2018-11-10 03:47:30,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:47:30,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:47:30,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:47:30,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:47:30,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/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 [2018-11-10 03:47:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:47:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2018-11-10 03:47:30,492 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-11-10 03:47:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:47:30,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:47:30,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:47:30,632 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:47:30,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:47:30 BoogieIcfgContainer [2018-11-10 03:47:30,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:47:30,633 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:47:30,633 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:47:30,636 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:47:30,637 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:47:30,637 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:47:30" (1/3) ... [2018-11-10 03:47:30,638 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2628fdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:47:30, skipping insertion in model container [2018-11-10 03:47:30,638 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:47:30,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:30" (2/3) ... [2018-11-10 03:47:30,639 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2628fdcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:47:30, skipping insertion in model container [2018-11-10 03:47:30,639 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:47:30,639 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:47:30" (3/3) ... [2018-11-10 03:47:30,642 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive_true-termination.c.i [2018-11-10 03:47:30,683 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:47:30,683 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:47:30,683 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:47:30,683 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:47:30,683 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:47:30,683 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:47:30,684 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:47:30,684 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:47:30,684 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:47:30,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 03:47:30,714 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 03:47:30,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:30,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:30,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 03:47:30,719 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:47:30,719 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:47:30,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 03:47:30,721 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 03:47:30,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:30,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:30,721 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 03:47:30,721 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:47:30,726 INFO L793 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 26#L28true assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 5#L33-4true [2018-11-10 03:47:30,726 INFO L795 eck$LassoCheckResult]: Loop: 5#L33-4true assume true; 29#L33-1true assume !!(main_~i~0 < main_~n~0); 18#L34true SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 12#L34-1true havoc main_#t~nondet10; 8#L33-3true main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 5#L33-4true [2018-11-10 03:47:30,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 68587, now seen corresponding path program 1 times [2018-11-10 03:47:30,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:30,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:30,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:30,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:30,804 INFO L82 PathProgramCache]: Analyzing trace with hash 76499348, now seen corresponding path program 1 times [2018-11-10 03:47:30,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:30,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:30,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:30,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:30,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:30,816 INFO L82 PathProgramCache]: Analyzing trace with hash 835395562, now seen corresponding path program 1 times [2018-11-10 03:47:30,816 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:30,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:30,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:30,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:30,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:31,030 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:31,031 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:31,031 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:31,031 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:31,032 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:47:31,032 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:31,032 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:31,032 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:31,032 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-10 03:47:31,032 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:31,033 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:31,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:31,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:31,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:31,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:31,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:31,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:31,381 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:31,385 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:47:31,386 INFO L122 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 [2018-11-10 03:47:31,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:31,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:31,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:31,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:31,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:31,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:31,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:31,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:31,393 INFO L122 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 [2018-11-10 03:47:31,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:31,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:31,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:31,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:31,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:31,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:31,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:31,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:31,396 INFO L122 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 [2018-11-10 03:47:31,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:31,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:31,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:31,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:31,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:31,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:31,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:31,405 INFO L122 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 [2018-11-10 03:47:31,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:31,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:31,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:31,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:31,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:31,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:31,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:31,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:31,410 INFO L122 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 [2018-11-10 03:47:31,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:31,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:31,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:31,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:31,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:31,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:31,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:31,420 INFO L122 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 [2018-11-10 03:47:31,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:31,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:31,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:31,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:31,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:31,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:31,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:31,434 INFO L122 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 [2018-11-10 03:47:31,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:31,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:31,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:31,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:31,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:31,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:31,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:31,447 INFO L122 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 [2018-11-10 03:47:31,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:31,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:31,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:31,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:31,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:31,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:31,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:47:31,552 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 03:47:31,552 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 03:47:31,554 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:47:31,555 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:47:31,556 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:47:31,557 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_main_~a~0.offset - 4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-11-10 03:47:31,569 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 03:47:31,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:47:31,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:47:31,579 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 03:47:31,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:31,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:31,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:31,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:31,696 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 [2018-11-10 03:47:31,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states. Second operand 4 states. [2018-11-10 03:47:31,756 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states.. Second operand 4 states. Result 65 states and 77 transitions. Complement of second has 9 states. [2018-11-10 03:47:31,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:47:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:47:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2018-11-10 03:47:31,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-10 03:47:31,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:31,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 03:47:31,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:31,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-10 03:47:31,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:31,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 77 transitions. [2018-11-10 03:47:31,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:47:31,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 27 states and 32 transitions. [2018-11-10 03:47:31,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 03:47:31,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 03:47:31,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2018-11-10 03:47:31,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:31,772 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 03:47:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2018-11-10 03:47:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-10 03:47:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 03:47:31,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-10 03:47:31,794 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 03:47:31,794 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-10 03:47:31,794 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:47:31,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2018-11-10 03:47:31,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:47:31,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:31,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:31,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 03:47:31,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:31,796 INFO L793 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 182#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 174#L33-4 assume true; 176#L33-1 assume !(main_~i~0 < main_~n~0); 168#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 171#insertionSortENTRY [2018-11-10 03:47:31,796 INFO L795 eck$LassoCheckResult]: Loop: 171#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 190#L10 assume ~i < ~size;havoc ~j~0; 192#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 186#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 183#L15-8 assume !true; 172#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 173#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 169#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 171#insertionSortENTRY [2018-11-10 03:47:31,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2043325080, now seen corresponding path program 1 times [2018-11-10 03:47:31,796 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:31,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:31,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:31,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:31,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:31,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:31,834 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:31,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:31,834 INFO L82 PathProgramCache]: Analyzing trace with hash 975085579, now seen corresponding path program 1 times [2018-11-10 03:47:31,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:31,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:31,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:31,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:31,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:31,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:47:31,843 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:47:31,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:31,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:31,847 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 03:47:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:31,865 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-10 03:47:31,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:31,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-11-10 03:47:31,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:47:31,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 34 transitions. [2018-11-10 03:47:31,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 03:47:31,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 03:47:31,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 34 transitions. [2018-11-10 03:47:31,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:31,869 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-10 03:47:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 34 transitions. [2018-11-10 03:47:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-10 03:47:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 03:47:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-10 03:47:31,872 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-10 03:47:31,872 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-10 03:47:31,872 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:47:31,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2018-11-10 03:47:31,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:47:31,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:31,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:31,874 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:31,874 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:31,874 INFO L793 eck$LassoCheckResult]: Stem: 258#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 247#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 237#L33-4 assume true; 238#L33-1 assume !!(main_~i~0 < main_~n~0); 254#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 249#L34-1 havoc main_#t~nondet10; 245#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 239#L33-4 assume true; 240#L33-1 assume !(main_~i~0 < main_~n~0); 233#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 236#insertionSortENTRY [2018-11-10 03:47:31,874 INFO L795 eck$LassoCheckResult]: Loop: 236#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 255#L10 assume ~i < ~size;havoc ~j~0; 257#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 251#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 248#L15-8 assume true;#t~short4 := ~j~0 > 0; 250#L15-1 assume !#t~short4; 253#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 241#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 242#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 234#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 236#insertionSortENTRY [2018-11-10 03:47:31,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:31,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2066243015, now seen corresponding path program 1 times [2018-11-10 03:47:31,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:31,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:31,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:31,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:31,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:31,891 INFO L82 PathProgramCache]: Analyzing trace with hash 167543067, now seen corresponding path program 1 times [2018-11-10 03:47:31,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:31,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:31,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:31,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:31,910 INFO L82 PathProgramCache]: Analyzing trace with hash -113722029, now seen corresponding path program 1 times [2018-11-10 03:47:31,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:31,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:31,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:31,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:32,248 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-11-10 03:47:32,376 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:32,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:32,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:32,376 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:32,376 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:47:32,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:32,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:32,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:32,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration3_Lasso [2018-11-10 03:47:32,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:32,377 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:32,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:32,662 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:32,662 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:47:32,662 INFO L122 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 [2018-11-10 03:47:32,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,667 INFO L122 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 [2018-11-10 03:47:32,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,669 INFO L122 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 [2018-11-10 03:47:32,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,677 INFO L122 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 [2018-11-10 03:47:32,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:32,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:32,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,681 INFO L122 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 [2018-11-10 03:47:32,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,683 INFO L122 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 [2018-11-10 03:47:32,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,685 INFO L122 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 [2018-11-10 03:47:32,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,687 INFO L122 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 [2018-11-10 03:47:32,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,689 INFO L122 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 [2018-11-10 03:47:32,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,691 INFO L122 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 [2018-11-10 03:47:32,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,694 INFO L122 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 [2018-11-10 03:47:32,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,696 INFO L122 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 [2018-11-10 03:47:32,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:32,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:32,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,700 INFO L122 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 [2018-11-10 03:47:32,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,702 INFO L122 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 [2018-11-10 03:47:32,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:32,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:32,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:32,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:32,704 INFO L122 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 [2018-11-10 03:47:32,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:32,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:32,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:32,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:32,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:32,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:32,725 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:47:32,729 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:47:32,729 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 03:47:32,730 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:47:32,731 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:47:32,731 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:47:32,731 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_#in~i) = -2*insertionSort_#in~i + 1 Supporting invariants [] [2018-11-10 03:47:32,740 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 03:47:32,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:32,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:32,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:32,909 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 03:47:32,909 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-10 03:47:33,223 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 209 states and 238 transitions. Complement of second has 32 states. [2018-11-10 03:47:33,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 03:47:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:47:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2018-11-10 03:47:33,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-10 03:47:33,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:33,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 21 letters. Loop has 10 letters. [2018-11-10 03:47:33,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:33,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 11 letters. Loop has 20 letters. [2018-11-10 03:47:33,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:33,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 238 transitions. [2018-11-10 03:47:33,234 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 52 [2018-11-10 03:47:33,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 157 states and 178 transitions. [2018-11-10 03:47:33,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-11-10 03:47:33,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2018-11-10 03:47:33,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 178 transitions. [2018-11-10 03:47:33,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:33,236 INFO L705 BuchiCegarLoop]: Abstraction has 157 states and 178 transitions. [2018-11-10 03:47:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 178 transitions. [2018-11-10 03:47:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 60. [2018-11-10 03:47:33,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 03:47:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-11-10 03:47:33,241 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-10 03:47:33,241 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-11-10 03:47:33,241 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:47:33,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 69 transitions. [2018-11-10 03:47:33,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 03:47:33,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:33,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:33,243 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:33,243 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:33,243 INFO L793 eck$LassoCheckResult]: Stem: 650#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 621#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 622#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 612#L33-4 assume true; 613#L33-1 assume !!(main_~i~0 < main_~n~0); 637#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 626#L34-1 havoc main_#t~nondet10; 620#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 614#L33-4 assume true; 615#L33-1 assume !(main_~i~0 < main_~n~0); 601#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 607#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 643#L10 assume ~i < ~size;havoc ~j~0; 648#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 634#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 635#L15-8 assume true;#t~short4 := ~j~0 > 0; 644#L15-1 assume !#t~short4; 631#L15-5 [2018-11-10 03:47:33,243 INFO L795 eck$LassoCheckResult]: Loop: 631#L15-5 assume !!#t~short4;havoc #t~mem3;havoc #t~short4; 638#L16 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L16 659#L16-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L16-1 658#L16-2 havoc #t~mem5; 623#L15-7 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 624#L15-8 assume true;#t~short4 := ~j~0 > 0; 627#L15-1 assume !#t~short4; 631#L15-5 [2018-11-10 03:47:33,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1064992924, now seen corresponding path program 1 times [2018-11-10 03:47:33,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:33,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:33,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:33,258 INFO L82 PathProgramCache]: Analyzing trace with hash 474460831, now seen corresponding path program 1 times [2018-11-10 03:47:33,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:33,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:33,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:33,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:33,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:33,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1921405476, now seen corresponding path program 1 times [2018-11-10 03:47:33,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:33,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:33,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:33,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:47:33,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:33,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:33,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:33,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:33,347 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-10 03:47:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:33,352 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-10 03:47:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:33,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 50 transitions. [2018-11-10 03:47:33,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 03:47:33,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 44 states and 49 transitions. [2018-11-10 03:47:33,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 03:47:33,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 03:47:33,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 49 transitions. [2018-11-10 03:47:33,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:33,354 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-10 03:47:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 49 transitions. [2018-11-10 03:47:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-10 03:47:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 03:47:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-10 03:47:33,356 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-10 03:47:33,357 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-10 03:47:33,357 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:47:33,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 49 transitions. [2018-11-10 03:47:33,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 03:47:33,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:33,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:33,358 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:33,358 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:33,358 INFO L793 eck$LassoCheckResult]: Stem: 753#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 730#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 731#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 719#L33-4 assume true; 720#L33-1 assume !!(main_~i~0 < main_~n~0); 741#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 733#L34-1 havoc main_#t~nondet10; 729#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 721#L33-4 assume true; 722#L33-1 assume !(main_~i~0 < main_~n~0); 715#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 718#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 748#L10 assume ~i < ~size;havoc ~j~0; 756#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 755#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 754#L15-8 assume true;#t~short4 := ~j~0 > 0; 749#L15-1 assume #t~short4; 750#L15-2 [2018-11-10 03:47:33,358 INFO L795 eck$LassoCheckResult]: Loop: 750#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 739#L15-3 #t~short4 := #t~mem3 > ~temp~0; 740#L15-5 assume !!#t~short4;havoc #t~mem3;havoc #t~short4; 727#L16 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L16 728#L16-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L16-1 713#L16-2 havoc #t~mem5; 717#L15-7 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 732#L15-8 assume true;#t~short4 := ~j~0 > 0; 734#L15-1 assume #t~short4; 750#L15-2 [2018-11-10 03:47:33,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:33,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1064992928, now seen corresponding path program 1 times [2018-11-10 03:47:33,358 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:33,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:33,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:33,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 03:47:33,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:33,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:47:33,391 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:33,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:33,391 INFO L82 PathProgramCache]: Analyzing trace with hash -562426342, now seen corresponding path program 1 times [2018-11-10 03:47:33,392 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:33,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:33,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:33,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:33,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:47:33,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:47:33,450 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 03:47:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:33,491 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-10 03:47:33,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:47:33,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2018-11-10 03:47:33,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 03:47:33,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 53 states and 57 transitions. [2018-11-10 03:47:33,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 03:47:33,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 03:47:33,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 57 transitions. [2018-11-10 03:47:33,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:33,493 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-10 03:47:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 57 transitions. [2018-11-10 03:47:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-11-10 03:47:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-10 03:47:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-10 03:47:33,495 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-10 03:47:33,496 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-10 03:47:33,496 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:47:33,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2018-11-10 03:47:33,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 03:47:33,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:33,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:33,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:33,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:33,497 INFO L793 eck$LassoCheckResult]: Stem: 871#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 849#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 850#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 838#L33-4 assume true; 839#L33-1 assume !!(main_~i~0 < main_~n~0); 861#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 852#L34-1 havoc main_#t~nondet10; 848#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 840#L33-4 assume true; 841#L33-1 assume !(main_~i~0 < main_~n~0); 836#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 837#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 864#L10 assume ~i < ~size;havoc ~j~0; 869#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 858#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 855#L15-8 assume true;#t~short4 := ~j~0 > 0; 856#L15-1 assume !#t~short4; 863#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 844#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 845#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 833#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 865#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 866#L10 assume ~i < ~size;havoc ~j~0; 868#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 857#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 853#L15-8 assume true;#t~short4 := ~j~0 > 0; 854#L15-1 assume #t~short4; 867#L15-2 [2018-11-10 03:47:33,497 INFO L795 eck$LassoCheckResult]: Loop: 867#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 859#L15-3 #t~short4 := #t~mem3 > ~temp~0; 860#L15-5 assume !!#t~short4;havoc #t~mem3;havoc #t~short4; 846#L16 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L16 847#L16-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L16-1 832#L16-2 havoc #t~mem5; 835#L15-7 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 851#L15-8 assume true;#t~short4 := ~j~0 > 0; 872#L15-1 assume #t~short4; 867#L15-2 [2018-11-10 03:47:33,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:33,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1338531578, now seen corresponding path program 1 times [2018-11-10 03:47:33,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:33,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:33,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:33,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 03:47:33,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:33,617 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:33,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:33,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:33,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:33,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-11-10 03:47:33,779 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:33,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash -562426342, now seen corresponding path program 2 times [2018-11-10 03:47:33,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:33,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:33,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:33,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:33,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 03:47:33,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 03:47:33,859 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. cyclomatic complexity: 7 Second operand 18 states. [2018-11-10 03:47:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:34,184 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-11-10 03:47:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 03:47:34,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 72 transitions. [2018-11-10 03:47:34,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 03:47:34,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 53 states and 57 transitions. [2018-11-10 03:47:34,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 03:47:34,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 03:47:34,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 57 transitions. [2018-11-10 03:47:34,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:34,187 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-10 03:47:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 57 transitions. [2018-11-10 03:47:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-11-10 03:47:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 03:47:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-10 03:47:34,189 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-10 03:47:34,189 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-10 03:47:34,189 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:47:34,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 53 transitions. [2018-11-10 03:47:34,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 03:47:34,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:34,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:34,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:34,191 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:34,191 INFO L793 eck$LassoCheckResult]: Stem: 1102#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1078#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1079#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1071#L33-4 assume true; 1072#L33-1 assume !!(main_~i~0 < main_~n~0); 1106#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 1105#L34-1 havoc main_#t~nondet10; 1077#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 1073#L33-4 assume true; 1074#L33-1 assume !!(main_~i~0 < main_~n~0); 1091#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 1081#L34-1 havoc main_#t~nondet10; 1082#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 1104#L33-4 assume true; 1103#L33-1 assume !(main_~i~0 < main_~n~0); 1065#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1066#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1097#L10 assume ~i < ~size;havoc ~j~0; 1101#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 1088#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1085#L15-8 assume true;#t~short4 := ~j~0 > 0; 1086#L15-1 assume !#t~short4; 1093#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1069#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 1070#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 1062#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1096#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1098#L10 assume ~i < ~size;havoc ~j~0; 1100#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 1087#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1083#L15-8 assume true;#t~short4 := ~j~0 > 0; 1084#L15-1 assume #t~short4; 1099#L15-2 [2018-11-10 03:47:34,191 INFO L795 eck$LassoCheckResult]: Loop: 1099#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 1089#L15-3 #t~short4 := #t~mem3 > ~temp~0; 1090#L15-5 assume !!#t~short4;havoc #t~mem3;havoc #t~short4; 1075#L16 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L16 1076#L16-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L16-1 1061#L16-2 havoc #t~mem5; 1064#L15-7 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1080#L15-8 assume true;#t~short4 := ~j~0 > 0; 1107#L15-1 assume #t~short4; 1099#L15-2 [2018-11-10 03:47:34,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2056903175, now seen corresponding path program 2 times [2018-11-10 03:47:34,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:34,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:34,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash -562426342, now seen corresponding path program 3 times [2018-11-10 03:47:34,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:34,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:34,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:34,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:34,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1347624738, now seen corresponding path program 1 times [2018-11-10 03:47:34,225 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:34,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:34,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:34,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:47:34,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:34,297 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:34,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:34,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:47:34,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:34,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-10 03:47:34,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:47:34,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:47:34,448 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. cyclomatic complexity: 7 Second operand 12 states. [2018-11-10 03:47:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:34,585 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-11-10 03:47:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 03:47:34,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 95 transitions. [2018-11-10 03:47:34,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 03:47:34,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 89 states and 95 transitions. [2018-11-10 03:47:34,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 03:47:34,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 03:47:34,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 95 transitions. [2018-11-10 03:47:34,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:34,588 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-11-10 03:47:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 95 transitions. [2018-11-10 03:47:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2018-11-10 03:47:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 03:47:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-11-10 03:47:34,592 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-11-10 03:47:34,592 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-11-10 03:47:34,592 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:47:34,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 79 transitions. [2018-11-10 03:47:34,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 03:47:34,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:34,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:34,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:34,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:34,594 INFO L793 eck$LassoCheckResult]: Stem: 1406#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1378#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1379#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1369#L33-4 assume true; 1370#L33-1 assume !!(main_~i~0 < main_~n~0); 1392#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 1393#L34-1 havoc main_#t~nondet10; 1375#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 1371#L33-4 assume true; 1372#L33-1 assume !!(main_~i~0 < main_~n~0); 1411#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 1382#L34-1 havoc main_#t~nondet10; 1383#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 1410#L33-4 assume true; 1407#L33-1 assume !(main_~i~0 < main_~n~0); 1362#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1363#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1396#L10 assume ~i < ~size;havoc ~j~0; 1430#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 1429#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1428#L15-8 assume true;#t~short4 := ~j~0 > 0; 1427#L15-1 assume !#t~short4; 1426#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1425#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 1424#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 1366#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1397#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1399#L10 assume ~i < ~size;havoc ~j~0; 1400#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 1387#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1388#L15-8 assume true;#t~short4 := ~j~0 > 0; 1421#L15-1 assume #t~short4; 1402#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 1403#L15-3 #t~short4 := #t~mem3 > ~temp~0; 1414#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1364#L15-9 [2018-11-10 03:47:34,594 INFO L795 eck$LassoCheckResult]: Loop: 1364#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 1365#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 1360#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1404#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1416#L10 assume ~i < ~size;havoc ~j~0; 1420#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 1419#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1418#L15-8 assume true;#t~short4 := ~j~0 > 0; 1417#L15-1 assume !#t~short4; 1394#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1364#L15-9 [2018-11-10 03:47:34,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash -904061446, now seen corresponding path program 1 times [2018-11-10 03:47:34,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:34,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:34,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:34,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:34,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:34,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1333822055, now seen corresponding path program 2 times [2018-11-10 03:47:34,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:34,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:34,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:34,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1810940640, now seen corresponding path program 2 times [2018-11-10 03:47:34,620 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:34,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 03:47:34,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:34,697 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:34,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:47:34,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:47:34,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:47:34,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:47:34,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:34,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 14 [2018-11-10 03:47:35,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:47:35,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:47:35,073 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. cyclomatic complexity: 9 Second operand 14 states. [2018-11-10 03:47:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:35,302 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-11-10 03:47:35,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 03:47:35,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 100 transitions. [2018-11-10 03:47:35,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-10 03:47:35,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 89 states and 95 transitions. [2018-11-10 03:47:35,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2018-11-10 03:47:35,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-11-10 03:47:35,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 95 transitions. [2018-11-10 03:47:35,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:35,305 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-11-10 03:47:35,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 95 transitions. [2018-11-10 03:47:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2018-11-10 03:47:35,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 03:47:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-10 03:47:35,307 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-10 03:47:35,307 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-10 03:47:35,308 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 03:47:35,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 68 transitions. [2018-11-10 03:47:35,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 03:47:35,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:35,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:35,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:35,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:35,309 INFO L793 eck$LassoCheckResult]: Stem: 1744#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1727#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1718#L33-4 assume true; 1719#L33-1 assume !!(main_~i~0 < main_~n~0); 1736#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 1737#L34-1 havoc main_#t~nondet10; 1746#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 1720#L33-4 assume true; 1721#L33-1 assume !!(main_~i~0 < main_~n~0); 1747#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 1730#L34-1 havoc main_#t~nondet10; 1724#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 1725#L33-4 assume true; 1745#L33-1 assume !(main_~i~0 < main_~n~0); 1713#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1714#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1770#L10 assume ~i < ~size;havoc ~j~0; 1769#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 1768#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1767#L15-8 assume true;#t~short4 := ~j~0 > 0; 1766#L15-1 assume !#t~short4; 1765#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1764#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 1763#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 1717#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1761#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1762#L10 assume ~i < ~size;havoc ~j~0; 1772#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 1771#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1729#L15-8 assume true;#t~short4 := ~j~0 > 0; 1741#L15-1 assume !#t~short4; 1738#L15-5 [2018-11-10 03:47:35,309 INFO L795 eck$LassoCheckResult]: Loop: 1738#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1715#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 1716#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 1711#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1739#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1740#L10 assume ~i < ~size;havoc ~j~0; 1742#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 1733#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1731#L15-8 assume true;#t~short4 := ~j~0 > 0; 1732#L15-1 assume #t~short4; 1743#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 1734#L15-3 #t~short4 := #t~mem3 > ~temp~0; 1735#L15-5 assume !!#t~short4;havoc #t~mem3;havoc #t~short4; 1722#L16 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L16 1723#L16-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L16-1 1710#L16-2 havoc #t~mem5; 1712#L15-7 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1749#L15-8 assume true;#t~short4 := ~j~0 > 0; 1748#L15-1 assume !#t~short4; 1738#L15-5 [2018-11-10 03:47:35,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash -2056903171, now seen corresponding path program 2 times [2018-11-10 03:47:35,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:35,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:35,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:35,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:47:35,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:35,356 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:35,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:47:35,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:47:35,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:47:35,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 03:47:35,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:35,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-10 03:47:35,422 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:47:35,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash -429887608, now seen corresponding path program 1 times [2018-11-10 03:47:35,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:35,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:35,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:47:35,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:47:35,760 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-11-10 03:47:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:35,850 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-11-10 03:47:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 03:47:35,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 80 transitions. [2018-11-10 03:47:35,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-10 03:47:35,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 75 transitions. [2018-11-10 03:47:35,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 03:47:35,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-10 03:47:35,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 75 transitions. [2018-11-10 03:47:35,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:35,853 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-11-10 03:47:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 75 transitions. [2018-11-10 03:47:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2018-11-10 03:47:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 03:47:35,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-10 03:47:35,855 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-10 03:47:35,855 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-10 03:47:35,855 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 03:47:35,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 64 transitions. [2018-11-10 03:47:35,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 03:47:35,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:35,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:35,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:35,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:35,857 INFO L793 eck$LassoCheckResult]: Stem: 2007#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1987#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1988#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1979#L33-4 assume true; 1980#L33-1 assume !!(main_~i~0 < main_~n~0); 1997#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 1998#L34-1 havoc main_#t~nondet10; 2010#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 1981#L33-4 assume true; 1982#L33-1 assume !!(main_~i~0 < main_~n~0); 2011#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 1991#L34-1 havoc main_#t~nondet10; 1985#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 1986#L33-4 assume true; 2008#L33-1 assume !(main_~i~0 < main_~n~0); 1974#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1975#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2009#L10 assume ~i < ~size;havoc ~j~0; 2004#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 2005#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2016#L15-8 assume true;#t~short4 := ~j~0 > 0; 2012#L15-1 assume !#t~short4; 2013#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2028#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 2006#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 1977#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2000#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2001#L10 assume ~i < ~size;havoc ~j~0; 2030#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 1996#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1992#L15-8 assume true;#t~short4 := ~j~0 > 0; 1993#L15-1 assume #t~short4; 2022#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 2021#L15-3 #t~short4 := #t~mem3 > ~temp~0; 2020#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1976#L15-9 [2018-11-10 03:47:35,857 INFO L795 eck$LassoCheckResult]: Loop: 1976#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 1978#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 1972#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2027#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2026#L10 assume ~i < ~size;havoc ~j~0; 2025#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 2024#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2023#L15-8 assume true;#t~short4 := ~j~0 > 0; 2002#L15-1 assume #t~short4; 2003#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 1994#L15-3 #t~short4 := #t~mem3 > ~temp~0; 1995#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 1976#L15-9 [2018-11-10 03:47:35,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:35,857 INFO L82 PathProgramCache]: Analyzing trace with hash -904061446, now seen corresponding path program 3 times [2018-11-10 03:47:35,857 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:35,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:35,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:35,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:35,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1902615210, now seen corresponding path program 1 times [2018-11-10 03:47:35,874 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:35,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:35,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:35,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:35,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:35,884 INFO L82 PathProgramCache]: Analyzing trace with hash -852325597, now seen corresponding path program 4 times [2018-11-10 03:47:35,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:35,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:35,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:35,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 03:47:35,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:35,969 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0cb3f7de-2e14-4361-9800-c0ea97bc15bb/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:47:35,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 03:47:35,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 03:47:35,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:47:35,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:36,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:36,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-10 03:47:36,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 03:47:36,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-11-10 03:47:36,363 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. cyclomatic complexity: 6 Second operand 23 states. [2018-11-10 03:47:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:36,620 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-11-10 03:47:36,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 03:47:36,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 107 transitions. [2018-11-10 03:47:36,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 03:47:36,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 69 states and 73 transitions. [2018-11-10 03:47:36,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 03:47:36,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-10 03:47:36,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 73 transitions. [2018-11-10 03:47:36,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:36,622 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-10 03:47:36,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 73 transitions. [2018-11-10 03:47:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-11-10 03:47:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-10 03:47:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-10 03:47:36,625 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-10 03:47:36,626 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-10 03:47:36,626 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 03:47:36,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 69 transitions. [2018-11-10 03:47:36,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 03:47:36,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:36,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:36,627 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:36,627 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:36,628 INFO L793 eck$LassoCheckResult]: Stem: 2353#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2333#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 2334#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2322#L33-4 assume true; 2323#L33-1 assume !!(main_~i~0 < main_~n~0); 2343#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 2344#L34-1 havoc main_#t~nondet10; 2362#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 2324#L33-4 assume true; 2325#L33-1 assume !!(main_~i~0 < main_~n~0); 2363#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 2337#L34-1 havoc main_#t~nondet10; 2331#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 2332#L33-4 assume true; 2357#L33-1 assume !!(main_~i~0 < main_~n~0); 2360#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 2359#L34-1 havoc main_#t~nondet10; 2358#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 2356#L33-4 assume true; 2354#L33-1 assume !(main_~i~0 < main_~n~0); 2320#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2321#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2370#L10 assume ~i < ~size;havoc ~j~0; 2367#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 2365#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2364#L15-8 assume true;#t~short4 := ~j~0 > 0; 2348#L15-1 assume !#t~short4; 2349#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2379#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 2378#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 2318#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2346#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2347#L10 assume ~i < ~size;havoc ~j~0; 2351#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 2352#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2375#L15-8 assume true;#t~short4 := ~j~0 > 0; 2361#L15-1 assume #t~short4; 2350#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 2341#L15-3 #t~short4 := #t~mem3 > ~temp~0; 2342#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2326#L15-9 [2018-11-10 03:47:36,628 INFO L795 eck$LassoCheckResult]: Loop: 2326#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 2328#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 2327#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2355#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2377#L10 assume ~i < ~size;havoc ~j~0; 2376#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 2340#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2338#L15-8 assume true;#t~short4 := ~j~0 > 0; 2339#L15-1 assume #t~short4; 2374#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 2373#L15-3 #t~short4 := #t~mem3 > ~temp~0; 2372#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2326#L15-9 [2018-11-10 03:47:36,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1329629703, now seen corresponding path program 5 times [2018-11-10 03:47:36,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:36,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:36,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:36,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:36,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1902615210, now seen corresponding path program 2 times [2018-11-10 03:47:36,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:36,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:36,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:36,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:36,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash -326247262, now seen corresponding path program 6 times [2018-11-10 03:47:36,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:36,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:36,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:36,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:37,284 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2018-11-10 03:47:37,472 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-10 03:47:37,800 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 113 [2018-11-10 03:47:37,856 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:37,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:37,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:37,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:37,857 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:47:37,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:37,857 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:37,857 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:37,857 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration11_Lasso [2018-11-10 03:47:37,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:37,857 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:37,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:37,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:37,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:37,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:37,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:37,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:37,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:37,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,249 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 99 [2018-11-10 03:47:38,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:38,653 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:38,653 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:47:38,654 INFO L122 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 [2018-11-10 03:47:38,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:38,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:38,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:38,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:38,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:38,656 INFO L122 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 [2018-11-10 03:47:38,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:38,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:38,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:38,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:38,657 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:38,658 INFO L122 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 [2018-11-10 03:47:38,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:38,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:38,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:38,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:38,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:38,659 INFO L122 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 [2018-11-10 03:47:38,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:38,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:38,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:38,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:38,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:38,661 INFO L122 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 [2018-11-10 03:47:38,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:38,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:38,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:38,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:38,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:38,662 INFO L122 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 [2018-11-10 03:47:38,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:38,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:38,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:38,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:38,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:38,663 INFO L122 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 [2018-11-10 03:47:38,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:38,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:38,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:38,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:38,669 INFO L122 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 [2018-11-10 03:47:38,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:38,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:38,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:38,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:38,672 INFO L122 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 [2018-11-10 03:47:38,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,673 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:47:38,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,674 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:47:38,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:38,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:38,678 INFO L122 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 [2018-11-10 03:47:38,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:38,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:38,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:38,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:38,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:38,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:38,715 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:47:38,748 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 03:47:38,748 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 03:47:38,748 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:47:38,749 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:47:38,749 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:47:38,749 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~size, insertionSort_~i) = 1*insertionSort_~size - 1*insertionSort_~i Supporting invariants [] [2018-11-10 03:47:38,821 INFO L297 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 03:47:38,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:38,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:38,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:38,917 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 03:47:38,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 69 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 03:47:38,981 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 69 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 99 states and 107 transitions. Complement of second has 16 states. [2018-11-10 03:47:38,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 03:47:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:47:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-10 03:47:38,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 40 letters. Loop has 12 letters. [2018-11-10 03:47:38,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:38,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 52 letters. Loop has 12 letters. [2018-11-10 03:47:38,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:38,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 40 letters. Loop has 24 letters. [2018-11-10 03:47:38,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:38,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 107 transitions. [2018-11-10 03:47:38,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:47:38,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 77 states and 82 transitions. [2018-11-10 03:47:38,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 03:47:38,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 03:47:38,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 82 transitions. [2018-11-10 03:47:38,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:47:38,986 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-10 03:47:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 82 transitions. [2018-11-10 03:47:38,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-10 03:47:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 03:47:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-10 03:47:38,996 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-10 03:47:38,997 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-10 03:47:38,997 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 03:47:38,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 80 transitions. [2018-11-10 03:47:38,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 03:47:38,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:47:38,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:47:38,998 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:38,998 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:38,998 INFO L793 eck$LassoCheckResult]: Stem: 2785#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2758#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 2759#L28 assume !(main_~n~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2744#L33-4 assume true; 2745#L33-1 assume !!(main_~i~0 < main_~n~0); 2772#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 2762#L34-1 havoc main_#t~nondet10; 2757#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 2746#L33-4 assume true; 2747#L33-1 assume !!(main_~i~0 < main_~n~0); 2797#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 2796#L34-1 havoc main_#t~nondet10; 2794#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 2793#L33-4 assume true; 2789#L33-1 assume !!(main_~i~0 < main_~n~0); 2792#L34 SUMMARY for call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + main_~i~0 * 4, 4); srcloc: L34 2791#L34-1 havoc main_#t~nondet10; 2790#L33-3 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 + 1;havoc main_#t~post9; 2788#L33-4 assume true; 2786#L33-1 assume !(main_~i~0 < main_~n~0); 2742#L33-5 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2743#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2775#L10 assume ~i < ~size;havoc ~j~0; 2780#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 2781#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2795#L15-8 assume true;#t~short4 := ~j~0 > 0; 2778#L15-1 assume !#t~short4; 2773#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2748#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 2749#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 2751#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2799#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2787#L10 assume ~i < ~size;havoc ~j~0; 2782#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 2783#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2811#L15-8 assume true;#t~short4 := ~j~0 > 0; 2810#L15-1 assume #t~short4; 2809#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 2808#L15-3 #t~short4 := #t~mem3 > ~temp~0; 2807#L15-5 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 2750#L15-9 SUMMARY for call write~int(~temp~0, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L15-9 2752#L17 #t~pre6 := ~i + 1;~i := ~i + 1; 2738#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2776#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2777#L10 assume ~i < ~size;havoc ~j~0; 2798#L13 SUMMARY for call #t~mem1 := read~int(~array.base, ~array.offset + ~i * 4, 4); srcloc: L13 2766#L13-1 ~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2760#L15-8 [2018-11-10 03:47:38,998 INFO L795 eck$LassoCheckResult]: Loop: 2760#L15-8 assume true;#t~short4 := ~j~0 > 0; 2763#L15-1 assume #t~short4; 2784#L15-2 SUMMARY for call #t~mem3 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L15-2 2768#L15-3 #t~short4 := #t~mem3 > ~temp~0; 2769#L15-5 assume !!#t~short4;havoc #t~mem3;havoc #t~short4; 2753#L16 SUMMARY for call #t~mem5 := read~int(~array.base, ~array.offset + (~j~0 - 1) * 4, 4); srcloc: L16 2754#L16-1 SUMMARY for call write~int(#t~mem5, ~array.base, ~array.offset + ~j~0 * 4, 4); srcloc: L16-1 2737#L16-2 havoc #t~mem5; 2739#L15-7 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2760#L15-8 [2018-11-10 03:47:38,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1612847790, now seen corresponding path program 7 times [2018-11-10 03:47:38,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:38,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:39,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:39,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash -770366348, now seen corresponding path program 4 times [2018-11-10 03:47:39,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:39,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:39,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:39,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:39,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:39,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash 55688295, now seen corresponding path program 2 times [2018-11-10 03:47:39,026 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:39,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:39,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:47:39,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:47:39,328 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2018-11-10 03:47:39,751 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2018-11-10 03:47:39,932 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-10 03:47:40,200 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 117 [2018-11-10 03:47:40,251 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:47:40,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:47:40,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:47:40,251 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:47:40,251 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:47:40,251 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:47:40,251 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:47:40,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:47:40,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration12_Lasso [2018-11-10 03:47:40,251 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:47:40,251 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:47:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:47:40,630 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:47:40,630 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:47:40,630 INFO L122 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 [2018-11-10 03:47:40,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,632 INFO L122 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 [2018-11-10 03:47:40,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,634 INFO L122 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 [2018-11-10 03:47:40,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,635 INFO L122 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 [2018-11-10 03:47:40,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,637 INFO L122 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 [2018-11-10 03:47:40,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:40,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:40,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,639 INFO L122 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 [2018-11-10 03:47:40,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,641 INFO L122 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 [2018-11-10 03:47:40,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,642 INFO L122 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 [2018-11-10 03:47:40,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,644 INFO L122 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 [2018-11-10 03:47:40,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,645 INFO L122 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 [2018-11-10 03:47:40,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,647 INFO L122 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 [2018-11-10 03:47:40,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,649 INFO L122 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 [2018-11-10 03:47:40,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,650 INFO L122 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 [2018-11-10 03:47:40,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:47:40,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:47:40,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:47:40,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,652 INFO L122 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 [2018-11-10 03:47:40,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,652 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:47:40,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,653 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:47:40,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:40,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:47:40,656 INFO L122 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 [2018-11-10 03:47:40,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:47:40,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:47:40,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:47:40,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:47:40,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:47:40,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:47:40,668 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:47:40,679 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 03:47:40,680 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 03:47:40,680 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:47:40,681 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:47:40,681 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:47:40,681 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~j~0) = 1*insertionSort_~j~0 Supporting invariants [] [2018-11-10 03:47:40,768 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2018-11-10 03:47:40,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:40,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:40,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:40,823 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 [2018-11-10 03:47:40,824 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 80 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 03:47:40,836 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 80 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 80 states and 85 transitions. Complement of second has 8 states. [2018-11-10 03:47:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:47:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:47:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-10 03:47:40,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 47 letters. Loop has 9 letters. [2018-11-10 03:47:40,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:40,837 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:47:40,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:40,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:40,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:40,890 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 [2018-11-10 03:47:40,890 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 80 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 03:47:40,903 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 80 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 80 states and 85 transitions. Complement of second has 8 states. [2018-11-10 03:47:40,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:47:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:47:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-10 03:47:40,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 47 letters. Loop has 9 letters. [2018-11-10 03:47:40,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:40,905 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:47:40,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:40,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:40,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:40,966 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 [2018-11-10 03:47:40,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 80 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 03:47:41,003 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 80 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 117 states and 126 transitions. Complement of second has 11 states. [2018-11-10 03:47:41,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 03:47:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:47:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-10 03:47:41,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 47 letters. Loop has 9 letters. [2018-11-10 03:47:41,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:41,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 56 letters. Loop has 9 letters. [2018-11-10 03:47:41,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:41,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 47 letters. Loop has 18 letters. [2018-11-10 03:47:41,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:47:41,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 126 transitions. [2018-11-10 03:47:41,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:47:41,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2018-11-10 03:47:41,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:47:41,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:47:41,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:47:41,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:47:41,009 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:47:41,010 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:47:41,010 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:47:41,010 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 03:47:41,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:47:41,010 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:47:41,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:47:41,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:47:41 BoogieIcfgContainer [2018-11-10 03:47:41,016 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:47:41,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:47:41,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:47:41,016 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:47:41,019 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:47:30" (3/4) ... [2018-11-10 03:47:41,021 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:47:41,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:47:41,022 INFO L168 Benchmark]: Toolchain (without parser) took 10809.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 120.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:41,023 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:47:41,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:41,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.45 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:41,024 INFO L168 Benchmark]: Boogie Preprocessor took 17.19 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:47:41,024 INFO L168 Benchmark]: RCFGBuilder took 213.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:41,025 INFO L168 Benchmark]: BuchiAutomizer took 10383.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.9 MB). Peak memory consumption was 141.8 MB. Max. memory is 11.5 GB. [2018-11-10 03:47:41,025 INFO L168 Benchmark]: Witness Printer took 5.29 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:47:41,028 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.05 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.45 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.19 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 213.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10383.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 137.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.9 MB). Peak memory consumption was 141.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.29 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * a + -4 * i + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 5 locations. One deterministic module has affine ranking function -2 * \old(i) + 1 and consists of 9 locations. One deterministic module has affine ranking function size + -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function j and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.3s and 13 iterations. TraceHistogramMax:4. Analysis of lassos took 7.9s. Construction of modules took 0.5s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 172 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 75 states and ocurred in iteration 11. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 287 SDtfs, 618 SDslu, 953 SDs, 0 SdLazy, 1278 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU3 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital213 mio100 ax100 hnf99 lsp96 ukn76 mio100 lsp54 div100 bol100 ite100 ukn100 eq166 hnf88 smp93 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 4 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...