./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e74ff11a050ce92aa6d5151e04de4f3f3a890d4c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:00:00,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:00:00,789 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:00:00,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:00:00,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:00:00,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:00:00,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:00:00,798 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:00:00,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:00:00,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:00:00,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:00:00,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:00:00,801 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:00:00,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:00:00,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:00:00,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:00:00,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:00:00,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:00:00,806 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:00:00,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:00:00,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:00:00,809 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:00:00,810 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:00:00,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:00:00,811 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:00:00,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:00:00,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:00:00,812 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:00:00,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:00:00,814 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:00:00,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:00:00,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:00:00,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:00:00,815 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:00:00,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:00:00,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:00:00,816 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 15:00:00,825 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:00:00,826 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:00:00,827 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:00:00,827 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:00:00,827 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:00:00,827 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:00:00,827 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:00:00,827 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:00:00,827 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:00:00,828 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:00:00,828 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:00:00,828 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:00:00,828 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:00:00,828 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:00:00,828 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:00:00,828 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:00:00,828 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:00:00,829 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:00:00,829 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:00:00,829 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:00:00,829 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:00:00,829 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:00:00,829 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:00:00,829 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:00:00,829 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:00:00,830 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:00:00,830 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:00:00,830 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:00:00,830 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:00:00,830 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:00:00,830 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:00:00,831 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:00:00,831 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e74ff11a050ce92aa6d5151e04de4f3f3a890d4c [2018-11-18 15:00:00,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:00:00,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:00:00,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:00:00,868 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:00:00,868 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:00:00,869 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-18 15:00:00,912 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/data/27e2c54fb/a148cac65d3f45fdba1b74b87b8b65f1/FLAG3b014adfc [2018-11-18 15:00:01,318 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:00:01,318 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-18 15:00:01,322 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/data/27e2c54fb/a148cac65d3f45fdba1b74b87b8b65f1/FLAG3b014adfc [2018-11-18 15:00:01,330 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/data/27e2c54fb/a148cac65d3f45fdba1b74b87b8b65f1 [2018-11-18 15:00:01,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:00:01,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:00:01,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:00:01,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:00:01,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:00:01,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb347f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01, skipping insertion in model container [2018-11-18 15:00:01,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:00:01,360 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:00:01,462 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:00:01,465 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:00:01,481 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:00:01,492 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:00:01,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01 WrapperNode [2018-11-18 15:00:01,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:00:01,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:00:01,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:00:01,493 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:00:01,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:00:01,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:00:01,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:00:01,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:00:01,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... [2018-11-18 15:00:01,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:00:01,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:00:01,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:00:01,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:00:01,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46f7c223-bc5c-4b6b-ab3a-979107fe6650/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:00:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:00:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:00:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:00:01,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:00:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:00:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:00:01,747 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:00:01,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:00:01 BoogieIcfgContainer [2018-11-18 15:00:01,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:00:01,747 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:00:01,748 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:00:01,750 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:00:01,750 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:00:01,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:00:01" (1/3) ... [2018-11-18 15:00:01,751 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a429d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:00:01, skipping insertion in model container [2018-11-18 15:00:01,751 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:00:01,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:00:01" (2/3) ... [2018-11-18 15:00:01,751 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a429d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:00:01, skipping insertion in model container [2018-11-18 15:00:01,751 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:00:01,751 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:00:01" (3/3) ... [2018-11-18 15:00:01,752 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-11-18 15:00:01,789 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:00:01,790 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:00:01,790 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:00:01,790 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:00:01,790 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:00:01,790 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:00:01,790 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:00:01,790 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:00:01,790 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:00:01,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-18 15:00:01,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 15:00:01,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:00:01,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:00:01,821 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:00:01,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 15:00:01,822 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:00:01,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-18 15:00:01,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-18 15:00:01,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:00:01,823 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:00:01,824 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:00:01,824 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 15:00:01,830 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~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.alloc(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; 11#L14-4true [2018-11-18 15:00:01,830 INFO L796 eck$LassoCheckResult]: Loop: 11#L14-4true assume true; 19#L14-1true 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; 14#L17-6true assume !true; 12#L17-7true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 15#L14-3true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 11#L14-4true [2018-11-18 15:00:01,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:01,834 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 15:00:01,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:01,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:01,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:01,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:01,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:01,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:01,908 INFO L82 PathProgramCache]: Analyzing trace with hash 34527834, now seen corresponding path program 1 times [2018-11-18 15:00:01,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:01,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:01,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:01,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:01,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:00:01,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:01,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:00:01,939 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:00:01,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:00:01,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:00:01,949 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-18 15:00:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:01,954 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-18 15:00:01,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:00:01,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-18 15:00:01,956 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:00:01,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 19 transitions. [2018-11-18 15:00:01,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 15:00:01,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 15:00:01,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-18 15:00:01,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:00:01,961 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 15:00:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-18 15:00:01,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 15:00:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 15:00:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-18 15:00:01,986 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 15:00:01,986 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-18 15:00:01,986 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:00:01,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-18 15:00:01,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 15:00:01,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:00:01,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:00:01,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 15:00:01,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:00:01,987 INFO L794 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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.alloc(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; 58#L14-4 [2018-11-18 15:00:01,987 INFO L796 eck$LassoCheckResult]: Loop: 58#L14-4 assume true; 61#L14-1 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; 63#L17-6 assume true; 52#L17-1 main_#t~short4 := main_~i~0 >= 0; 50#L17-2 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; 51#L17-4 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 59#L17-7 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 60#L14-3 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 58#L14-4 [2018-11-18 15:00:01,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:01,988 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 15:00:01,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:01,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:01,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:01,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:01,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:02,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1677837808, now seen corresponding path program 1 times [2018-11-18 15:00:02,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:02,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:02,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:02,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:00:02,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:02,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:02,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1926568014, now seen corresponding path program 1 times [2018-11-18 15:00:02,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:02,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:02,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:02,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:02,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:02,210 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-11-18 15:00:02,312 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:00:02,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:00:02,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:00:02,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:00:02,313 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:00:02,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:00:02,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:00:02,314 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:00:02,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2018-11-18 15:00:02,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:00:02,314 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:00:02,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:02,731 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:00:02,734 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:00:02,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:02,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:02,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:02,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:02,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:02,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:02,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:02,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:02,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:02,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:02,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:02,781 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:00:02,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:02,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:02,786 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 15:00:02,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:02,828 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:00:02,862 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 15:00:02,862 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 15:00:02,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:00:02,865 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:00:02,865 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:00:02,866 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 [] [2018-11-18 15:00:02,885 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-18 15:00:02,890 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:00:02,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:02,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:02,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:00:02,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 15:00:02,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 15:00:02,999 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 30 states and 37 transitions. Complement of second has 6 states. [2018-11-18 15:00:03,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:00:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:00:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 15:00:03,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-18 15:00:03,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:03,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-18 15:00:03,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:03,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-18 15:00:03,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:03,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-18 15:00:03,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 15:00:03,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 22 states and 28 transitions. [2018-11-18 15:00:03,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 15:00:03,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 15:00:03,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2018-11-18 15:00:03,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:00:03,007 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-18 15:00:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2018-11-18 15:00:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 15:00:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 15:00:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-11-18 15:00:03,010 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-18 15:00:03,010 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-11-18 15:00:03,010 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:00:03,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-11-18 15:00:03,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 15:00:03,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:00:03,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:00:03,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 15:00:03,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:00:03,012 INFO L794 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 167#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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.alloc(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; 168#L14-4 assume true; 172#L14-1 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; 175#L17-6 [2018-11-18 15:00:03,012 INFO L796 eck$LassoCheckResult]: Loop: 175#L17-6 assume true; 161#L17-1 main_#t~short4 := main_~i~0 >= 0; 157#L17-2 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; 158#L17-4 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;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;main_~i~0 := main_~i~0 - 1; 175#L17-6 [2018-11-18 15:00:03,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2018-11-18 15:00:03,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:03,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:03,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1387371, now seen corresponding path program 1 times [2018-11-18 15:00:03,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:03,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:03,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:03,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash 149950386, now seen corresponding path program 1 times [2018-11-18 15:00:03,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:03,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:03,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,242 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:00:03,242 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:00:03,242 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:00:03,242 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:00:03,243 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:00:03,243 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:00:03,243 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:00:03,243 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:00:03,243 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-18 15:00:03,243 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:00:03,243 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:00:03,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:03,445 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:00:03,445 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:00:03,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:03,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:03,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:03,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:03,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:03,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:03,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:03,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:03,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:03,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:03,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:03,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:03,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:03,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:03,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:03,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:03,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:03,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:03,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:03,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:03,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:03,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:03,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:03,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:03,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:03,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:03,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:03,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:03,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:03,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:03,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:03,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:03,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:03,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:03,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:03,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:03,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:03,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:03,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:03,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:03,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:03,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:03,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:03,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:03,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:03,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:03,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:03,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:03,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:03,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:03,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:03,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:03,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:03,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:03,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:03,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:03,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:03,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:03,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:03,491 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:00:03,503 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 15:00:03,503 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 15:00:03,503 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:00:03,504 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:00:03,505 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:00:03,505 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-18 15:00:03,538 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-18 15:00:03,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:03,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:03,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:00:03,615 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 15:00:03,615 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 15:00:03,652 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 93 states and 111 transitions. Complement of second has 9 states. [2018-11-18 15:00:03,653 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 [2018-11-18 15:00:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 15:00:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2018-11-18 15:00:03,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-18 15:00:03,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:03,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-18 15:00:03,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:03,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 8 letters. [2018-11-18 15:00:03,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:03,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 111 transitions. [2018-11-18 15:00:03,656 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2018-11-18 15:00:03,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 61 states and 74 transitions. [2018-11-18 15:00:03,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 15:00:03,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 15:00:03,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 74 transitions. [2018-11-18 15:00:03,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:00:03,658 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 74 transitions. [2018-11-18 15:00:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 74 transitions. [2018-11-18 15:00:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2018-11-18 15:00:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 15:00:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2018-11-18 15:00:03,660 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-18 15:00:03,661 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-18 15:00:03,661 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:00:03,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2018-11-18 15:00:03,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 15:00:03,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:00:03,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:00:03,662 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 15:00:03,662 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 15:00:03,663 INFO L794 eck$LassoCheckResult]: Stem: 352#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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.alloc(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; 344#L14-4 assume true; 348#L14-1 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 341#L14-5 main_~k~0 := 1; 339#L23-4 [2018-11-18 15:00:03,663 INFO L796 eck$LassoCheckResult]: Loop: 339#L23-4 assume true; 340#L23-1 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);assume { :begin_inline___VERIFIER_assert } true;__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; 355#L4 assume !(0 == __VERIFIER_assert_~cond); 356#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem8;havoc main_#t~mem7; 342#L23-3 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 339#L23-4 [2018-11-18 15:00:03,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:03,663 INFO L82 PathProgramCache]: Analyzing trace with hash 28694816, now seen corresponding path program 1 times [2018-11-18 15:00:03,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:03,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash 68870930, now seen corresponding path program 1 times [2018-11-18 15:00:03,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:03,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:03,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:03,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1275782483, now seen corresponding path program 1 times [2018-11-18 15:00:03,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:03,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:03,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:00:03,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:03,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:00:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:00:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:00:03,900 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-18 15:00:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:03,945 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2018-11-18 15:00:03,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:00:03,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2018-11-18 15:00:03,946 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 15:00:03,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 40 transitions. [2018-11-18 15:00:03,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 15:00:03,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 15:00:03,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 40 transitions. [2018-11-18 15:00:03,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:00:03,947 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 40 transitions. [2018-11-18 15:00:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 40 transitions. [2018-11-18 15:00:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-18 15:00:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 15:00:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-18 15:00:03,949 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-18 15:00:03,949 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-18 15:00:03,949 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:00:03,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2018-11-18 15:00:03,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 15:00:03,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:00:03,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:00:03,950 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:00:03,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:00:03,950 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 420#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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.alloc(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; 421#L14-4 assume true; 424#L14-1 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; 435#L17-6 assume true; 415#L17-1 main_#t~short4 := main_~i~0 >= 0; 412#L17-2 assume !main_#t~short4; 413#L17-4 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 422#L17-7 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 423#L14-3 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 425#L14-4 assume true; 427#L14-1 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; 429#L17-6 [2018-11-18 15:00:03,950 INFO L796 eck$LassoCheckResult]: Loop: 429#L17-6 assume true; 414#L17-1 main_#t~short4 := main_~i~0 >= 0; 410#L17-2 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; 411#L17-4 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;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;main_~i~0 := main_~i~0 - 1; 429#L17-6 [2018-11-18 15:00:03,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:03,951 INFO L82 PathProgramCache]: Analyzing trace with hash -243698379, now seen corresponding path program 1 times [2018-11-18 15:00:03,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:03,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:03,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:00:03,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:03,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:00:03,978 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:00:03,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:03,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1387371, now seen corresponding path program 2 times [2018-11-18 15:00:03,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:03,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:03,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:03,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:00:04,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:00:04,039 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 15:00:04,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:04,096 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-18 15:00:04,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:00:04,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2018-11-18 15:00:04,098 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-18 15:00:04,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 68 transitions. [2018-11-18 15:00:04,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-18 15:00:04,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-18 15:00:04,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 68 transitions. [2018-11-18 15:00:04,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:00:04,099 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-18 15:00:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 68 transitions. [2018-11-18 15:00:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2018-11-18 15:00:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 15:00:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-18 15:00:04,101 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-18 15:00:04,101 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-18 15:00:04,101 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:00:04,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 50 transitions. [2018-11-18 15:00:04,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-18 15:00:04,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:00:04,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:00:04,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:00:04,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 15:00:04,104 INFO L794 eck$LassoCheckResult]: Stem: 527#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 519#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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.alloc(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; 520#L14-4 assume true; 521#L14-1 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; 541#L17-6 assume true; 514#L17-1 main_#t~short4 := main_~i~0 >= 0; 510#L17-2 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; 511#L17-4 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 525#L17-7 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 526#L14-3 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 522#L14-4 assume true; 524#L14-1 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 517#L14-5 main_~k~0 := 1; 515#L23-4 [2018-11-18 15:00:04,104 INFO L796 eck$LassoCheckResult]: Loop: 515#L23-4 assume true; 516#L23-1 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);assume { :begin_inline___VERIFIER_assert } true;__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; 531#L4 assume !(0 == __VERIFIER_assert_~cond); 532#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem8;havoc main_#t~mem7; 518#L23-3 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 515#L23-4 [2018-11-18 15:00:04,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:04,104 INFO L82 PathProgramCache]: Analyzing trace with hash -739722543, now seen corresponding path program 1 times [2018-11-18 15:00:04,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:04,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:04,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:00:04,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash 68870930, now seen corresponding path program 2 times [2018-11-18 15:00:04,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:04,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash 696674882, now seen corresponding path program 1 times [2018-11-18 15:00:04,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:04,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:04,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:00:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,401 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2018-11-18 15:00:04,474 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:00:04,474 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:00:04,474 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:00:04,474 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:00:04,474 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:00:04,474 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:00:04,474 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:00:04,474 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:00:04,474 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-18 15:00:04,474 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:00:04,474 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:00:04,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:04,796 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:00:04,796 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:00:04,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:04,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:04,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:04,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:04,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:04,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:04,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:04,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:04,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:04,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:04,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:04,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:04,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:04,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:04,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:04,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:04,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:04,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:04,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:04,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:04,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:04,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:04,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:04,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:04,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:04,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:04,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:04,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:04,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:04,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:04,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:04,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:04,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:04,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:04,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:04,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:04,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:04,835 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:00:04,849 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 15:00:04,849 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 15:00:04,850 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:00:04,850 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:00:04,850 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:00:04,850 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 [] [2018-11-18 15:00:04,885 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-18 15:00:04,886 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 15:00:04,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:04,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:04,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:00:04,923 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 15:00:04,924 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 50 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-18 15:00:04,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 50 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 46 states and 56 transitions. Complement of second has 6 states. [2018-11-18 15:00:04,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 15:00:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:00:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 15:00:04,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-18 15:00:04,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:04,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-18 15:00:04,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:04,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 10 letters. [2018-11-18 15:00:04,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:04,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-11-18 15:00:04,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:00:04,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 35 states and 43 transitions. [2018-11-18 15:00:04,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 15:00:04,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 15:00:04,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 43 transitions. [2018-11-18 15:00:04,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 15:00:04,949 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-18 15:00:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 43 transitions. [2018-11-18 15:00:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 15:00:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 15:00:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-18 15:00:04,951 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-18 15:00:04,951 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-18 15:00:04,951 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:00:04,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2018-11-18 15:00:04,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 15:00:04,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:00:04,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:00:04,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 15:00:04,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 15:00:04,952 INFO L794 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 696#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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.alloc(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; 697#L14-4 assume true; 700#L14-1 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; 720#L17-6 assume true; 721#L17-1 main_#t~short4 := main_~i~0 >= 0; 725#L17-2 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; 712#L17-4 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 698#L17-7 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 699#L14-3 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 701#L14-4 assume true; 703#L14-1 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; 707#L17-6 assume true; 704#L17-1 main_#t~short4 := main_~i~0 >= 0; 692#L17-2 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; 693#L17-4 [2018-11-18 15:00:04,952 INFO L796 eck$LassoCheckResult]: Loop: 693#L17-4 assume !!main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4;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;main_~i~0 := main_~i~0 - 1; 709#L17-6 assume true; 717#L17-1 main_#t~short4 := main_~i~0 >= 0; 715#L17-2 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; 693#L17-4 [2018-11-18 15:00:04,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash 2091245339, now seen corresponding path program 2 times [2018-11-18 15:00:04,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:04,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:04,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:04,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1772631, now seen corresponding path program 3 times [2018-11-18 15:00:04,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:04,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:00:04,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:04,979 INFO L82 PathProgramCache]: Analyzing trace with hash -366489999, now seen corresponding path program 1 times [2018-11-18 15:00:04,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:00:04,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:00:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:00:04,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:00:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:00:05,281 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 92 [2018-11-18 15:00:05,456 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-11-18 15:00:05,457 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:00:05,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:00:05,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:00:05,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:00:05,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:00:05,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:00:05,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:00:05,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:00:05,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-18 15:00:05,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:00:05,457 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:00:05,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,613 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-18 15:00:05,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:00:05,916 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:00:05,916 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:00:05,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:05,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:05,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:05,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:05,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:05,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:05,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:05,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:05,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:05,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:05,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:05,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:05,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:05,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:05,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:05,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:05,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:05,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:05,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:05,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:05,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:05,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:05,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:00:05,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:00:05,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:00:05,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,934 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 15:00:05,934 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 15:00:05,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,936 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 15:00:05,936 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 15:00:05,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:05,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:05,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:00:05,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:00:05,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:00:05,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:00:05,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:00:05,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:00:05,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:00:05,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 15:00:05,968 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 15:00:05,979 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-18 15:00:05,979 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 15:00:05,979 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 15:00:05,980 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 15:00:05,980 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 15:00:05,980 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-18 15:00:06,016 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-18 15:00:06,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:06,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:06,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:00:06,056 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 15:00:06,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 15:00:06,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 77 states and 94 transitions. Complement of second has 9 states. [2018-11-18 15:00:06,099 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 [2018-11-18 15:00:06,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:00:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-18 15:00:06,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-18 15:00:06,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:06,100 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:00:06,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:06,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:06,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:06,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:00:06,138 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 15:00:06,138 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 15:00:06,170 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 64 states and 75 transitions. Complement of second has 9 states. [2018-11-18 15:00:06,172 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 [2018-11-18 15:00:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:00:06,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-18 15:00:06,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-18 15:00:06,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:06,172 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 15:00:06,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:06,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:06,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:00:06,210 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 15:00:06,210 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 15:00:06,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 43 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 106 states and 136 transitions. Complement of second has 10 states. [2018-11-18 15:00:06,249 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 [2018-11-18 15:00:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 15:00:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-18 15:00:06,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-18 15:00:06,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:06,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-18 15:00:06,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:06,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-18 15:00:06,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 15:00:06,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 136 transitions. [2018-11-18 15:00:06,252 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:00:06,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 0 states and 0 transitions. [2018-11-18 15:00:06,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:00:06,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:00:06,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:00:06,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:00:06,253 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:00:06,253 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:00:06,253 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:00:06,253 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 15:00:06,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:00:06,254 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:00:06,254 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:00:06,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:00:06 BoogieIcfgContainer [2018-11-18 15:00:06,259 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:00:06,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:00:06,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:00:06,260 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:00:06,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:00:01" (3/4) ... [2018-11-18 15:00:06,263 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:00:06,263 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:00:06,264 INFO L168 Benchmark]: Toolchain (without parser) took 4930.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 348.1 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -134.5 MB). Peak memory consumption was 213.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:00:06,264 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:00:06,264 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.93 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:00:06,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.27 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:00:06,265 INFO L168 Benchmark]: Boogie Preprocessor took 53.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -227.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:00:06,266 INFO L168 Benchmark]: RCFGBuilder took 177.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:00:06,266 INFO L168 Benchmark]: BuchiAutomizer took 4511.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 172.5 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 62.3 MB). Peak memory consumption was 234.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:00:06,267 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:00:06,270 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.93 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.27 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -227.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 177.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4511.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 172.5 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 62.3 MB). Peak memory consumption was 234.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.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 4 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 4.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 47 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 152 SDtfs, 194 SDslu, 133 SDs, 0 SdLazy, 160 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital219 mio100 ax100 hnf99 lsp85 ukn75 mio100 lsp67 div213 bol100 ite100 ukn100 eq147 hnf59 smp88 dnf147 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 7 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...