./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9722a10940ebd7a5d75170225a40cd37454d0528 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:58:07,608 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:58:07,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:58:07,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:58:07,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:58:07,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:58:07,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:58:07,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:58:07,628 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:58:07,629 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:58:07,630 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:58:07,630 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:58:07,631 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:58:07,632 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:58:07,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:58:07,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:58:07,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:58:07,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:58:07,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:58:07,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:58:07,642 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:58:07,643 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:58:07,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:58:07,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:58:07,647 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:58:07,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:58:07,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:58:07,650 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:58:07,651 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:58:07,652 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:58:07,652 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:58:07,653 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:58:07,653 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:58:07,653 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:58:07,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:58:07,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:58:07,656 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:58:07,674 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:58:07,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:58:07,675 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:58:07,676 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:58:07,676 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:58:07,676 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:58:07,676 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:58:07,676 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:58:07,677 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:58:07,677 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:58:07,677 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:58:07,677 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:58:07,677 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:58:07,677 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:58:07,678 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:58:07,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:58:07,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:58:07,678 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:58:07,678 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:58:07,678 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:58:07,679 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:58:07,679 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:58:07,679 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:58:07,679 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:58:07,679 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:58:07,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:58:07,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:58:07,680 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:58:07,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:58:07,680 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:58:07,680 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:58:07,681 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:58:07,682 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2019-01-01 22:58:07,718 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:58:07,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:58:07,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:58:07,737 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:58:07,737 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:58:07,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2019-01-01 22:58:07,815 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2e112d8/dea3a5d9975946598f3a60c96312b0b7/FLAGb07e9dca1 [2019-01-01 22:58:08,298 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:58:08,299 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/insertion_sort_false-unreach-call_true-termination.i [2019-01-01 22:58:08,306 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2e112d8/dea3a5d9975946598f3a60c96312b0b7/FLAGb07e9dca1 [2019-01-01 22:58:08,641 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc2e112d8/dea3a5d9975946598f3a60c96312b0b7 [2019-01-01 22:58:08,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:58:08,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:58:08,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:58:08,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:58:08,662 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:58:08,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:58:08" (1/1) ... [2019-01-01 22:58:08,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69949a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:08, skipping insertion in model container [2019-01-01 22:58:08,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:58:08" (1/1) ... [2019-01-01 22:58:08,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:58:08,702 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:58:08,928 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:58:08,938 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:58:08,976 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:58:09,006 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:58:09,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09 WrapperNode [2019-01-01 22:58:09,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:58:09,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:58:09,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:58:09,009 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:58:09,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... [2019-01-01 22:58:09,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... [2019-01-01 22:58:09,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:58:09,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:58:09,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:58:09,072 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:58:09,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... [2019-01-01 22:58:09,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... [2019-01-01 22:58:09,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... [2019-01-01 22:58:09,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... [2019-01-01 22:58:09,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... [2019-01-01 22:58:09,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... [2019-01-01 22:58:09,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... [2019-01-01 22:58:09,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:58:09,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:58:09,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:58:09,132 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:58:09,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:09,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:58:09,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:58:09,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:58:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:58:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:58:09,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:58:09,757 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:58:09,758 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-01 22:58:09,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:58:09 BoogieIcfgContainer [2019-01-01 22:58:09,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:58:09,759 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:58:09,759 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:58:09,764 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:58:09,765 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:58:09,765 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:58:08" (1/3) ... [2019-01-01 22:58:09,767 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45754253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:58:09, skipping insertion in model container [2019-01-01 22:58:09,767 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:58:09,767 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:58:09" (2/3) ... [2019-01-01 22:58:09,768 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45754253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:58:09, skipping insertion in model container [2019-01-01 22:58:09,768 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:58:09,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:58:09" (3/3) ... [2019-01-01 22:58:09,770 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2019-01-01 22:58:09,844 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:58:09,847 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:58:09,847 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:58:09,848 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:58:09,850 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:58:09,850 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:58:09,850 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:58:09,851 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:58:09,851 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:58:09,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 22:58:09,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-01 22:58:09,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:09,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:09,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:58:09,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:09,924 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:58:09,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-01-01 22:58:09,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-01 22:58:09,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:09,927 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:09,927 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:58:09,928 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:09,937 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 13#L14-3true [2019-01-01 22:58:09,938 INFO L796 eck$LassoCheckResult]: Loop: 13#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 16#L17-5true assume !true; 14#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 17#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 13#L14-3true [2019-01-01 22:58:09,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 22:58:09,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:10,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:10,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2019-01-01 22:58:10,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:10,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:10,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:10,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:10,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:10,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:58:10,142 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:58:10,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 22:58:10,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 22:58:10,163 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-01-01 22:58:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:10,174 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-01-01 22:58:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 22:58:10,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-01-01 22:58:10,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-01 22:58:10,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2019-01-01 22:58:10,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-01 22:58:10,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 22:58:10,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-01 22:58:10,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:10,186 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 22:58:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-01 22:58:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-01 22:58:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 22:58:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-01-01 22:58:10,220 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 22:58:10,220 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 22:58:10,221 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:58:10,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-01-01 22:58:10,222 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-01 22:58:10,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:10,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:10,222 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:58:10,223 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:58:10,224 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 54#L14-3 [2019-01-01 22:58:10,224 INFO L796 eck$LassoCheckResult]: Loop: 54#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 51#L17-5 main_#t~short4 := main_~i~0 >= 0; 48#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 49#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 59#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 60#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 54#L14-3 [2019-01-01 22:58:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-01 22:58:10,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:10,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:10,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:10,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2019-01-01 22:58:10,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:10,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2019-01-01 22:58:10,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:10,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:10,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:10,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:10,870 WARN L181 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-01-01 22:58:11,147 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 22:58:11,377 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-01 22:58:11,390 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:11,391 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:11,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:11,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:11,392 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:11,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:11,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:11,393 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:11,393 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-01 22:58:11,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:11,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:11,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:11,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:11,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:11,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:11,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:11,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:11,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:11,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:11,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:11,753 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 22:58:12,344 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-01-01 22:58:12,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:12,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:12,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:12,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:12,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:12,587 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-01 22:58:12,693 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-01 22:58:13,227 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-01 22:58:13,312 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:13,318 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:13,321 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 [2019-01-01 22:58:13,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:13,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:13,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:13,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,330 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 [2019-01-01 22:58:13,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:13,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:13,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:13,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,336 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 [2019-01-01 22:58:13,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:13,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:13,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:13,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,342 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 [2019-01-01 22:58:13,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:13,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:13,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:13,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,348 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 [2019-01-01 22:58:13,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:13,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:13,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:13,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,354 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 [2019-01-01 22:58:13,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:13,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:13,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:13,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,361 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 [2019-01-01 22:58:13,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:13,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:13,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:13,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,368 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 [2019-01-01 22:58:13,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:13,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:13,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,378 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 [2019-01-01 22:58:13,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:13,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:13,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:13,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,385 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 [2019-01-01 22:58:13,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:13,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:13,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:13,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,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 [2019-01-01 22:58:13,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:13,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:13,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:13,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:13,416 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 [2019-01-01 22:58:13,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:13,417 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:58:13,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:13,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:13,432 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:58:13,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:13,554 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:13,672 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-01 22:58:13,673 INFO L444 ModelExtractionUtils]: 8 out of 19 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-01 22:58:13,676 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:13,684 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:13,685 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:13,686 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~#v~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 1*ULTIMATE.start_main_~#v~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-01-01 22:58:13,757 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-01 22:58:13,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:58:14,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:14,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:14,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:14,151 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:58:14,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 22:58:14,232 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2019-01-01 22:58:14,233 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 [2019-01-01 22:58:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:58:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-01 22:58:14,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 22:58:14,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:14,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 22:58:14,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:14,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2019-01-01 22:58:14,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:14,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2019-01-01 22:58:14,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:14,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2019-01-01 22:58:14,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 22:58:14,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 22:58:14,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2019-01-01 22:58:14,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:14,246 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-01-01 22:58:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2019-01-01 22:58:14,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-01 22:58:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 22:58:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-01-01 22:58:14,250 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 22:58:14,250 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-01 22:58:14,250 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:58:14,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-01-01 22:58:14,252 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:14,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:14,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:14,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:58:14,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:58:14,255 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 158#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 152#L17-5 [2019-01-01 22:58:14,255 INFO L796 eck$LassoCheckResult]: Loop: 152#L17-5 main_#t~short4 := main_~i~0 >= 0; 147#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 148#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 155#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 151#L18-2 main_~i~0 := main_~i~0 - 1; 152#L17-5 [2019-01-01 22:58:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:14,255 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2019-01-01 22:58:14,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:14,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:14,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:14,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:14,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:14,289 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 1 times [2019-01-01 22:58:14,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:14,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:14,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:14,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:14,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash 268259380, now seen corresponding path program 1 times [2019-01-01 22:58:14,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:14,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:14,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:14,662 WARN L181 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-01-01 22:58:14,826 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-01 22:58:14,944 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-01 22:58:14,958 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:14,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:14,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:14,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:14,959 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:14,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:14,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:14,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:14,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration3_Lasso [2019-01-01 22:58:14,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:14,959 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:14,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:14,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:14,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:14,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:14,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:14,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:15,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:15,332 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 22:58:15,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:15,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:15,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:15,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:15,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:15,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:15,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:15,704 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:15,705 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:15,705 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 [2019-01-01 22:58:15,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:15,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:15,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:15,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,712 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 [2019-01-01 22:58:15,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:15,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:15,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:15,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,718 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 [2019-01-01 22:58:15,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:15,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:15,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:15,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,722 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 [2019-01-01 22:58:15,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:15,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:15,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:15,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,728 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 [2019-01-01 22:58:15,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:15,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:15,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,736 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 [2019-01-01 22:58:15,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:15,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:15,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:15,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,742 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 [2019-01-01 22:58:15,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:15,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:15,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,753 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 [2019-01-01 22:58:15,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:15,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:15,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,767 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 [2019-01-01 22:58:15,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,767 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:58:15,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,771 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:58:15,771 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:15,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,777 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 [2019-01-01 22:58:15,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:15,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:15,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:15,785 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 [2019-01-01 22:58:15,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:15,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:15,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:15,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:15,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:15,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:15,808 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:15,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:58:15,814 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:58:15,815 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:15,816 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:15,816 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:15,816 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2019-01-01 22:58:15,872 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-01 22:58:15,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:15,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:15,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:16,162 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 22:58:16,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-01 22:58:16,238 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 81 states and 107 transitions. Complement of second has 9 states. [2019-01-01 22:58:16,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:58:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2019-01-01 22:58:16,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 3 letters. Loop has 5 letters. [2019-01-01 22:58:16,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:16,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 8 letters. Loop has 5 letters. [2019-01-01 22:58:16,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:16,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 3 letters. Loop has 10 letters. [2019-01-01 22:58:16,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:16,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2019-01-01 22:58:16,253 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 21 [2019-01-01 22:58:16,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 51 states and 67 transitions. [2019-01-01 22:58:16,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 22:58:16,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 22:58:16,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2019-01-01 22:58:16,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:16,264 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2019-01-01 22:58:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2019-01-01 22:58:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-01-01 22:58:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:58:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-01-01 22:58:16,270 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-01-01 22:58:16,270 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-01-01 22:58:16,271 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:58:16,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2019-01-01 22:58:16,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:16,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:16,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:16,274 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 22:58:16,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:16,275 INFO L794 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 321#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 322#L14-4 main_~k~0 := 1; 323#L24-3 [2019-01-01 22:58:16,275 INFO L796 eck$LassoCheckResult]: Loop: 323#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 324#L4 assume !(0 == __VERIFIER_assert_~cond); 332#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 330#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 323#L24-3 [2019-01-01 22:58:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2019-01-01 22:58:16,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:16,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:16,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:16,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:16,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2019-01-01 22:58:16,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:16,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:16,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:16,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:16,338 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2019-01-01 22:58:16,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:16,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:16,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:16,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:16,864 WARN L181 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2019-01-01 22:58:17,101 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2019-01-01 22:58:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:17,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:17,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 22:58:17,501 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-01-01 22:58:17,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:58:17,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:58:17,502 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-01-01 22:58:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:17,765 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2019-01-01 22:58:17,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:58:17,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2019-01-01 22:58:17,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:17,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 41 transitions. [2019-01-01 22:58:17,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 22:58:17,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-01 22:58:17,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-01-01 22:58:17,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:17,769 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-01-01 22:58:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-01-01 22:58:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-01-01 22:58:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:58:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-01-01 22:58:17,775 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-01-01 22:58:17,775 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-01-01 22:58:17,775 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:58:17,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2019-01-01 22:58:17,777 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:17,777 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:17,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:17,778 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:17,778 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:58:17,778 INFO L794 eck$LassoCheckResult]: Stem: 398#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 393#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 394#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 399#L17-5 main_#t~short4 := main_~i~0 >= 0; 385#L17-1 assume !main_#t~short4; 386#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 401#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 402#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 400#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 388#L17-5 [2019-01-01 22:58:17,778 INFO L796 eck$LassoCheckResult]: Loop: 388#L17-5 main_#t~short4 := main_~i~0 >= 0; 383#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 384#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 391#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 387#L18-2 main_~i~0 := main_~i~0 - 1; 388#L17-5 [2019-01-01 22:58:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2019-01-01 22:58:17,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:17,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:17,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:17,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:17,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 22:58:17,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:17,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:17,868 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2019-01-01 22:58:17,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:17,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:17,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:18,340 WARN L181 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-01-01 22:58:18,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:58:18,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:58:18,374 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-01 22:58:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:18,456 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2019-01-01 22:58:18,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:58:18,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2019-01-01 22:58:18,459 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:58:18,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2019-01-01 22:58:18,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-01 22:58:18,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-01 22:58:18,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2019-01-01 22:58:18,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:18,461 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2019-01-01 22:58:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2019-01-01 22:58:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-01-01 22:58:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 22:58:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2019-01-01 22:58:18,467 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-01-01 22:58:18,467 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-01-01 22:58:18,467 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:58:18,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2019-01-01 22:58:18,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:18,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:18,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:18,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:18,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:18,470 INFO L794 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 486#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 487#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 492#L17-5 main_#t~short4 := main_~i~0 >= 0; 507#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 504#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 496#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 497#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 493#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 488#L14-4 main_~k~0 := 1; 489#L24-3 [2019-01-01 22:58:18,470 INFO L796 eck$LassoCheckResult]: Loop: 489#L24-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 490#L4 assume !(0 == __VERIFIER_assert_~cond); 500#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 498#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 489#L24-3 [2019-01-01 22:58:18,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:18,471 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2019-01-01 22:58:18,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:18,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:18,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2019-01-01 22:58:18,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:18,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:18,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:18,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2019-01-01 22:58:18,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:18,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:18,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:18,815 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-01-01 22:58:19,198 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2019-01-01 22:58:19,377 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-01-01 22:58:19,378 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:19,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:19,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:19,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:19,379 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:19,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:19,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:19,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:19,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration6_Lasso [2019-01-01 22:58:19,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:19,379 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:19,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,629 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-01-01 22:58:19,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:19,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,237 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:20,237 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:20,238 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 [2019-01-01 22:58:20,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,246 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 [2019-01-01 22:58:20,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,248 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 [2019-01-01 22:58:20,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,255 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 [2019-01-01 22:58:20,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:20,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:20,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,265 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 [2019-01-01 22:58:20,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,271 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 [2019-01-01 22:58:20,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,279 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 [2019-01-01 22:58:20,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,281 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 [2019-01-01 22:58:20,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,284 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 [2019-01-01 22:58:20,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,287 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 [2019-01-01 22:58:20,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,299 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 [2019-01-01 22:58:20,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:20,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:20,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:20,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:20,302 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 [2019-01-01 22:58:20,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:20,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:20,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:20,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:20,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:20,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:20,341 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:20,398 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:58:20,398 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:58:20,399 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:20,403 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:20,403 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:20,403 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2019-01-01 22:58:20,541 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-01-01 22:58:20,551 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:58:20,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:20,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:20,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:21,041 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:58:21,041 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-01 22:58:21,113 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 39 states and 52 transitions. Complement of second has 4 states. [2019-01-01 22:58:21,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:58:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-01-01 22:58:21,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-01 22:58:21,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:21,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2019-01-01 22:58:21,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:21,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2019-01-01 22:58:21,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:21,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2019-01-01 22:58:21,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:58:21,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 41 transitions. [2019-01-01 22:58:21,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 22:58:21,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 22:58:21,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2019-01-01 22:58:21,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:21,126 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-01-01 22:58:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2019-01-01 22:58:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-01 22:58:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 22:58:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2019-01-01 22:58:21,130 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-01-01 22:58:21,132 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2019-01-01 22:58:21,133 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:58:21,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2019-01-01 22:58:21,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:58:21,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:21,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:21,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 22:58:21,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:58:21,137 INFO L794 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 632#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 633#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 643#L17-5 main_#t~short4 := main_~i~0 >= 0; 660#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 653#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 647#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 648#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 644#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 645#L17-5 main_#t~short4 := main_~i~0 >= 0; 635#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 636#L17-3 [2019-01-01 22:58:21,137 INFO L796 eck$LassoCheckResult]: Loop: 636#L17-3 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 650#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 639#L18-2 main_~i~0 := main_~i~0 - 1; 640#L17-5 main_#t~short4 := main_~i~0 >= 0; 654#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 636#L17-3 [2019-01-01 22:58:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:21,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1268629571, now seen corresponding path program 2 times [2019-01-01 22:58:21,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:21,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash 53536832, now seen corresponding path program 3 times [2019-01-01 22:58:21,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:21,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:21,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:21,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2116886020, now seen corresponding path program 1 times [2019-01-01 22:58:21,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:21,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:21,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:21,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:21,817 WARN L181 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-01-01 22:58:21,990 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 22:58:22,328 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 95 [2019-01-01 22:58:22,783 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-01-01 22:58:22,786 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:22,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:22,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:22,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:22,787 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:22,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:22,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:22,787 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:22,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration7_Lasso [2019-01-01 22:58:22,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:22,787 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:22,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:22,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:22,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:22,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:22,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:22,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:22,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:22,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,320 WARN L181 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-01-01 22:58:23,672 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-01-01 22:58:23,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:23,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:24,172 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-01-01 22:58:24,414 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-01-01 22:58:24,688 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-01 22:58:24,693 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:24,693 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:24,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 [2019-01-01 22:58:24,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:24,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:24,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:24,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,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 [2019-01-01 22:58:24,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:24,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:24,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:24,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,703 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 [2019-01-01 22:58:24,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:24,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:24,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,707 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 [2019-01-01 22:58:24,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:24,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:24,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:24,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,713 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 [2019-01-01 22:58:24,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:24,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:24,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:24,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,715 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 [2019-01-01 22:58:24,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:24,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:24,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,723 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 [2019-01-01 22:58:24,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:24,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:24,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:24,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,728 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 [2019-01-01 22:58:24,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:24,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:24,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:24,736 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 [2019-01-01 22:58:24,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:24,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:24,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:24,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:24,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:24,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:24,750 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:24,759 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 22:58:24,759 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 22:58:24,760 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:24,760 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:24,763 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:24,763 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 22:58:24,879 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-01-01 22:58:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:24,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:24,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:25,005 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 22:58:25,006 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-01 22:58:25,079 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2019-01-01 22:58:25,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:58:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-01-01 22:58:25,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 22:58:25,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:25,084 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:58:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:25,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:25,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:25,253 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 22:58:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:25,254 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 22:58:25,254 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-01 22:58:25,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 55 states and 72 transitions. Complement of second has 9 states. [2019-01-01 22:58:25,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:58:25,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2019-01-01 22:58:25,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 22:58:25,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:25,344 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:58:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:25,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:25,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:25,412 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 22:58:25,412 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-01-01 22:58:25,532 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 65 states and 93 transitions. Complement of second has 8 states. [2019-01-01 22:58:25,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:58:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2019-01-01 22:58:25,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 5 letters. [2019-01-01 22:58:25,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:25,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-01 22:58:25,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:25,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 10 letters. [2019-01-01 22:58:25,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:25,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 93 transitions. [2019-01-01 22:58:25,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:58:25,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2019-01-01 22:58:25,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:58:25,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:58:25,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:58:25,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:25,543 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:58:25,543 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:58:25,543 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:58:25,543 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:58:25,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:58:25,543 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:58:25,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:58:25,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:58:25 BoogieIcfgContainer [2019-01-01 22:58:25,550 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:58:25,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:58:25,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:58:25,551 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:58:25,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:58:09" (3/4) ... [2019-01-01 22:58:25,556 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:58:25,556 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:58:25,557 INFO L168 Benchmark]: Toolchain (without parser) took 16910.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 950.0 MB in the beginning and 902.1 MB in the end (delta: 47.9 MB). Peak memory consumption was 330.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:25,558 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:58:25,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.45 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:25,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.94 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:58:25,561 INFO L168 Benchmark]: Boogie Preprocessor took 59.62 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:25,562 INFO L168 Benchmark]: RCFGBuilder took 627.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -150.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:25,563 INFO L168 Benchmark]: BuchiAutomizer took 15790.80 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 902.1 MB in the end (delta: 181.8 MB). Peak memory consumption was 352.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:58:25,564 INFO L168 Benchmark]: Witness Printer took 5.56 ms. Allocated memory is still 1.3 GB. Free memory is still 902.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:58:25,571 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.45 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 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 62.94 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.62 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 627.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -150.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15790.80 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 170.9 MB). Free memory was 1.1 GB in the beginning and 902.1 MB in the end (delta: 181.8 MB). Peak memory consumption was 352.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.56 ms. Allocated memory is still 1.3 GB. Free memory is still 902.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -4 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[v] + -1 * v and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.7s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 13.0s. Construction of modules took 0.3s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 136 SDtfs, 196 SDslu, 108 SDs, 0 SdLazy, 203 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf99 lsp84 ukn83 mio100 lsp65 div189 bol100 ite100 ukn100 eq148 hnf64 smp87 dnf183 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 269ms VariablesStem: 6 VariablesLoop: 10 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...