./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/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_c8d4a9ab-7324-487e-816d-50d18bd92b12/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/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-635dfa2 [2018-12-02 09:20:30,477 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:20:30,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:20:30,486 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:20:30,486 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:20:30,487 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:20:30,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:20:30,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:20:30,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:20:30,490 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:20:30,491 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:20:30,491 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:20:30,492 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:20:30,492 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:20:30,493 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:20:30,493 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:20:30,494 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:20:30,495 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:20:30,497 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:20:30,498 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:20:30,498 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:20:30,499 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:20:30,501 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:20:30,501 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:20:30,501 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:20:30,502 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:20:30,503 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:20:30,503 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:20:30,504 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:20:30,504 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:20:30,505 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:20:30,505 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:20:30,505 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:20:30,506 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:20:30,506 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:20:30,506 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:20:30,507 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 09:20:30,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:20:30,517 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:20:30,518 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 09:20:30,518 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 09:20:30,518 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 09:20:30,518 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 09:20:30,519 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 09:20:30,519 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 09:20:30,519 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 09:20:30,519 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 09:20:30,519 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 09:20:30,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:20:30,519 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:20:30,519 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 09:20:30,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:20:30,520 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:20:30,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:20:30,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 09:20:30,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 09:20:30,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 09:20:30,520 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:20:30,520 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:20:30,521 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 09:20:30,521 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 09:20:30,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 09:20:30,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:20:30,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:20:30,521 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 09:20:30,521 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:20:30,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 09:20:30,521 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 09:20:30,522 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 09:20:30,522 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_c8d4a9ab-7324-487e-816d-50d18bd92b12/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-12-02 09:20:30,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:20:30,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:20:30,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:20:30,554 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:20:30,555 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:20:30,555 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-12-02 09:20:30,595 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/bin-2019/uautomizer/data/b2218975f/6aa66f7e7cfa406da262773bae974025/FLAG748393fbd [2018-12-02 09:20:30,946 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:20:30,947 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/sv-benchmarks/c/loops/insertion_sort_true-unreach-call_true-termination.i [2018-12-02 09:20:30,950 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/bin-2019/uautomizer/data/b2218975f/6aa66f7e7cfa406da262773bae974025/FLAG748393fbd [2018-12-02 09:20:30,958 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/bin-2019/uautomizer/data/b2218975f/6aa66f7e7cfa406da262773bae974025 [2018-12-02 09:20:30,959 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:20:30,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:20:30,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:20:30,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:20:30,963 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:20:30,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:20:30" (1/1) ... [2018-12-02 09:20:30,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d10e54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:30, skipping insertion in model container [2018-12-02 09:20:30,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:20:30" (1/1) ... [2018-12-02 09:20:30,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:20:30,978 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:20:31,068 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:20:31,070 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:20:31,082 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:20:31,093 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:20:31,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31 WrapperNode [2018-12-02 09:20:31,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:20:31,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:20:31,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:20:31,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:20:31,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... [2018-12-02 09:20:31,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... [2018-12-02 09:20:31,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:20:31,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:20:31,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:20:31,124 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:20:31,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... [2018-12-02 09:20:31,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... [2018-12-02 09:20:31,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... [2018-12-02 09:20:31,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... [2018-12-02 09:20:31,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... [2018-12-02 09:20:31,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... [2018-12-02 09:20:31,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... [2018-12-02 09:20:31,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:20:31,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:20:31,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:20:31,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:20:31,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8d4a9ab-7324-487e-816d-50d18bd92b12/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-12-02 09:20:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 09:20:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:20:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:20:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:20:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 09:20:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:20:31,325 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:20:31,325 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-02 09:20:31,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:20:31 BoogieIcfgContainer [2018-12-02 09:20:31,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:20:31,326 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 09:20:31,326 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 09:20:31,328 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 09:20:31,329 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 09:20:31,329 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 09:20:30" (1/3) ... [2018-12-02 09:20:31,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f6a8fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:20:31, skipping insertion in model container [2018-12-02 09:20:31,330 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 09:20:31,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:20:31" (2/3) ... [2018-12-02 09:20:31,330 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f6a8fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 09:20:31, skipping insertion in model container [2018-12-02 09:20:31,330 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 09:20:31,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:20:31" (3/3) ... [2018-12-02 09:20:31,331 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-12-02 09:20:31,364 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 09:20:31,364 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 09:20:31,364 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 09:20:31,364 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 09:20:31,364 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:20:31,365 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:20:31,365 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 09:20:31,365 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:20:31,365 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 09:20:31,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 09:20:31,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-02 09:20:31,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:20:31,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:20:31,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 09:20:31,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 09:20:31,391 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 09:20:31,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-02 09:20:31,392 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-02 09:20:31,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:20:31,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:20:31,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 09:20:31,392 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 09:20:31,397 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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-3true [2018-12-02 09:20:31,397 INFO L796 eck$LassoCheckResult]: Loop: 11#L14-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 13#L17-5true assume !true; 12#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 14#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 11#L14-3true [2018-12-02 09:20:31,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:31,403 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 09:20:31,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:31,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:31,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:31,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:31,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1249301, now seen corresponding path program 1 times [2018-12-02 09:20:31,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:31,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:31,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:20:31,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:20:31,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:20:31,501 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 09:20:31,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 09:20:31,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 09:20:31,511 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-02 09:20:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:31,516 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-12-02 09:20:31,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 09:20:31,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-12-02 09:20:31,518 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 09:20:31,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 16 transitions. [2018-12-02 09:20:31,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 09:20:31,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 09:20:31,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-12-02 09:20:31,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 09:20:31,521 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-02 09:20:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-12-02 09:20:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 09:20:31,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 09:20:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-02 09:20:31,538 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-02 09:20:31,538 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-02 09:20:31,538 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 09:20:31,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-12-02 09:20:31,538 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-02 09:20:31,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:20:31,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:20:31,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 09:20:31,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 09:20:31,539 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 48#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 49#L14-3 [2018-12-02 09:20:31,539 INFO L796 eck$LassoCheckResult]: Loop: 49#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 55#L17-5 main_#t~short4 := main_~i~0 >= 0; 44#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 45#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 53#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 54#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 49#L14-3 [2018-12-02 09:20:31,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 09:20:31,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:31,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:31,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:31,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:31,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208270, now seen corresponding path program 1 times [2018-12-02 09:20:31,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:31,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:31,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:31,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:31,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:31,571 INFO L82 PathProgramCache]: Analyzing trace with hash 268257488, now seen corresponding path program 1 times [2018-12-02 09:20:31,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:31,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:31,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:31,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:31,700 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-12-02 09:20:31,791 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 09:20:31,792 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 09:20:31,792 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 09:20:31,792 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 09:20:31,793 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 09:20:31,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 09:20:31,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 09:20:31,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 09:20:31,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2018-12-02 09:20:31,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 09:20:31,793 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 09:20:31,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:31,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,144 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 09:20:32,147 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 09:20:32,148 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-12-02 09:20:32,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,152 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-12-02 09:20:32,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,154 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-12-02 09:20:32,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,155 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,156 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-12-02 09:20:32,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,157 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-12-02 09:20:32,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,159 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-12-02 09:20:32,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,161 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-12-02 09:20:32,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,163 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-12-02 09:20:32,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:20:32,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:32,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,167 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-12-02 09:20:32,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,168 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-12-02 09:20:32,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,170 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-12-02 09:20:32,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,172 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-12-02 09:20:32,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,174 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-12-02 09:20:32,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:32,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:32,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:32,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,176 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-12-02 09:20:32,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:20:32,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:32,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,183 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-12-02 09:20:32,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,183 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 09:20:32,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,187 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 09:20:32,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:32,214 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 09:20:32,237 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 09:20:32,237 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 09:20:32,238 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 09:20:32,239 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 09:20:32,239 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 09:20:32,240 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-12-02 09:20:32,245 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-02 09:20:32,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 09:20:32,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:32,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:32,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:20:32,294 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-12-02 09:20:32,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 09:20:32,334 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 34 transitions. Complement of second has 6 states. [2018-12-02 09:20:32,334 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-12-02 09:20:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 09:20:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 09:20:32,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-02 09:20:32,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:32,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-02 09:20:32,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:32,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-02 09:20:32,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:32,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2018-12-02 09:20:32,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 09:20:32,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 25 transitions. [2018-12-02 09:20:32,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 09:20:32,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-02 09:20:32,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-02 09:20:32,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 09:20:32,339 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-02 09:20:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-02 09:20:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-02 09:20:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 09:20:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2018-12-02 09:20:32,340 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-02 09:20:32,340 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2018-12-02 09:20:32,340 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 09:20:32,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2018-12-02 09:20:32,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 09:20:32,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:20:32,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:20:32,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 09:20:32,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 09:20:32,341 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 144#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 151#L17-5 [2018-12-02 09:20:32,341 INFO L796 eck$LassoCheckResult]: Loop: 151#L17-5 main_#t~short4 := main_~i~0 >= 0; 137#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 138#L17-3 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; 151#L17-5 [2018-12-02 09:20:32,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2018-12-02 09:20:32,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:32,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:32,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:32,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:32,354 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 1 times [2018-12-02 09:20:32,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:32,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:32,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:32,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:32,360 INFO L82 PathProgramCache]: Analyzing trace with hash 889663632, now seen corresponding path program 1 times [2018-12-02 09:20:32,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:32,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:32,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:32,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,526 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 09:20:32,526 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 09:20:32,526 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 09:20:32,526 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 09:20:32,526 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 09:20:32,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 09:20:32,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 09:20:32,527 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 09:20:32,527 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration3_Lasso [2018-12-02 09:20:32,527 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 09:20:32,527 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 09:20:32,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:32,719 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 09:20:32,719 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 09:20:32,720 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-12-02 09:20:32,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:20:32,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:32,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:32,726 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-12-02 09:20:32,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:32,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:32,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:32,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:32,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:20:32,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:32,742 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 09:20:32,752 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 09:20:32,753 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-02 09:20:32,753 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 09:20:32,754 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 09:20:32,754 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 09:20:32,754 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-12-02 09:20:32,758 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-02 09:20:32,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:32,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:32,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:20:32,808 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-12-02 09:20:32,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-02 09:20:32,852 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 69 states and 87 transitions. Complement of second has 9 states. [2018-12-02 09:20:32,852 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-12-02 09:20:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 09:20:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-12-02 09:20:32,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 3 letters. [2018-12-02 09:20:32,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:32,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2018-12-02 09:20:32,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:32,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 3 letters. Loop has 6 letters. [2018-12-02 09:20:32,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:32,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 87 transitions. [2018-12-02 09:20:32,856 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 19 [2018-12-02 09:20:32,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 45 states and 58 transitions. [2018-12-02 09:20:32,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-02 09:20:32,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 09:20:32,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2018-12-02 09:20:32,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 09:20:32,859 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2018-12-02 09:20:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2018-12-02 09:20:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2018-12-02 09:20:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 09:20:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-12-02 09:20:32,862 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-02 09:20:32,862 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-02 09:20:32,862 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 09:20:32,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-12-02 09:20:32,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 09:20:32,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:20:32,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:20:32,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 09:20:32,863 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 09:20:32,863 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 283#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 284#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 285#L14-4 main_~k~0 := 1; 281#L23-3 [2018-12-02 09:20:32,863 INFO L796 eck$LassoCheckResult]: Loop: 281#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 282#L4 assume !(0 == __VERIFIER_assert_~cond); 295#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 286#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 281#L23-3 [2018-12-02 09:20:32,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:32,864 INFO L82 PathProgramCache]: Analyzing trace with hash 925727, now seen corresponding path program 1 times [2018-12-02 09:20:32,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:32,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:32,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:32,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 1 times [2018-12-02 09:20:32,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:32,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:32,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash 231194408, now seen corresponding path program 1 times [2018-12-02 09:20:32,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:32,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:32,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:32,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:20:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:20:33,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:20:33,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:20:33,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:20:33,110 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-12-02 09:20:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:33,150 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-12-02 09:20:33,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:20:33,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2018-12-02 09:20:33,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 09:20:33,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 32 transitions. [2018-12-02 09:20:33,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 09:20:33,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 09:20:33,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2018-12-02 09:20:33,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 09:20:33,151 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-02 09:20:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2018-12-02 09:20:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-02 09:20:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 09:20:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-12-02 09:20:33,152 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-02 09:20:33,152 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-12-02 09:20:33,152 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 09:20:33,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-12-02 09:20:33,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 09:20:33,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:20:33,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:20:33,153 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:33,153 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 09:20:33,153 INFO L794 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 342#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 343#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 349#L17-5 main_#t~short4 := main_~i~0 >= 0; 338#L17-1 assume !main_#t~short4; 339#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 347#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 348#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 350#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 352#L17-5 [2018-12-02 09:20:33,153 INFO L796 eck$LassoCheckResult]: Loop: 352#L17-5 main_#t~short4 := main_~i~0 >= 0; 336#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 337#L17-3 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; 352#L17-5 [2018-12-02 09:20:33,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:33,154 INFO L82 PathProgramCache]: Analyzing trace with hash -272105412, now seen corresponding path program 1 times [2018-12-02 09:20:33,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:33,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:33,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:33,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:20:33,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:20:33,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:20:33,166 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 09:20:33,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash 44790, now seen corresponding path program 2 times [2018-12-02 09:20:33,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:33,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:33,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:33,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:33,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:20:33,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:20:33,220 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-12-02 09:20:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:20:33,250 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2018-12-02 09:20:33,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:20:33,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-12-02 09:20:33,251 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-02 09:20:33,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 53 transitions. [2018-12-02 09:20:33,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 09:20:33,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-02 09:20:33,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2018-12-02 09:20:33,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 09:20:33,251 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2018-12-02 09:20:33,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2018-12-02 09:20:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-12-02 09:20:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 09:20:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2018-12-02 09:20:33,253 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-02 09:20:33,253 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-12-02 09:20:33,253 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 09:20:33,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2018-12-02 09:20:33,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-02 09:20:33,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:20:33,254 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:20:33,254 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:20:33,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 09:20:33,254 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 417#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 418#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 424#L17-5 main_#t~short4 := main_~i~0 >= 0; 413#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 414#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 422#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 423#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 425#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 419#L14-4 main_~k~0 := 1; 415#L23-3 [2018-12-02 09:20:33,254 INFO L796 eck$LassoCheckResult]: Loop: 415#L23-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 416#L4 assume !(0 == __VERIFIER_assert_~cond); 429#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 420#L23-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 415#L23-3 [2018-12-02 09:20:33,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:33,254 INFO L82 PathProgramCache]: Analyzing trace with hash 97408492, now seen corresponding path program 1 times [2018-12-02 09:20:33,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:33,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:33,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:33,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:33,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2285066, now seen corresponding path program 2 times [2018-12-02 09:20:33,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:33,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:33,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:33,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:33,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:33,277 INFO L82 PathProgramCache]: Analyzing trace with hash 699287157, now seen corresponding path program 1 times [2018-12-02 09:20:33,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:33,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:33,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:33,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:33,539 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 09:20:33,539 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 09:20:33,539 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 09:20:33,539 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 09:20:33,539 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 09:20:33,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 09:20:33,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 09:20:33,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 09:20:33,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration6_Lasso [2018-12-02 09:20:33,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 09:20:33,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 09:20:33,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:33,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 09:20:33,827 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 09:20:33,827 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-12-02 09:20:33,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:33,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:33,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:33,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,828 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-12-02 09:20:33,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:33,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:33,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:33,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,829 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-12-02 09:20:33,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:33,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:33,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:33,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,830 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-12-02 09:20:33,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:20:33,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:33,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,832 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-12-02 09:20:33,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:33,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:33,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:33,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,833 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-12-02 09:20:33,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:33,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:33,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:33,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,834 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-12-02 09:20:33,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:33,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:33,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:33,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,835 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-12-02 09:20:33,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:33,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:33,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:33,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,837 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-12-02 09:20:33,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:33,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:33,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:33,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,839 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-12-02 09:20:33,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 09:20:33,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 09:20:33,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 09:20:33,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:33,840 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-12-02 09:20:33,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:33,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:33,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:33,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:33,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:20:33,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:33,861 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 09:20:33,882 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-02 09:20:33,882 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 09:20:33,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 09:20:33,883 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-12-02 09:20:33,884 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 09:20:33,884 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 - 1*ULTIMATE.start_main_~#v~0.offset + 17179869178 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 + 17179869180 >= 0] [2018-12-02 09:20:33,895 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2018-12-02 09:20:33,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:33,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:33,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-12-02 09:20:33,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:20:33,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-02 09:20:33,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:20:33,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 09:20:33,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-12-02 09:20:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:34,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:20:34,022 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 09:20:34,023 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-12-02 09:20:34,054 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 33 states and 43 transitions. Complement of second has 5 states. [2018-12-02 09:20:34,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 09:20:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 09:20:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 09:20:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 09:20:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-02 09:20:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:34,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-02 09:20:34,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:34,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2018-12-02 09:20:34,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 09:20:34,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 24 states and 32 transitions. [2018-12-02 09:20:34,056 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 09:20:34,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-02 09:20:34,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2018-12-02 09:20:34,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 09:20:34,056 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-02 09:20:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2018-12-02 09:20:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-02 09:20:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 09:20:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-12-02 09:20:34,057 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-02 09:20:34,058 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-02 09:20:34,058 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 09:20:34,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-12-02 09:20:34,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-02 09:20:34,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 09:20:34,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 09:20:34,058 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-12-02 09:20:34,058 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-02 09:20:34,058 INFO L794 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 567#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.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; 568#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 574#L17-5 main_#t~short4 := main_~i~0 >= 0; 588#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 584#L17-3 assume !main_#t~short4;havoc main_#t~mem3;havoc main_#t~short4; 578#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 579#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 575#L14-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 576#L17-5 main_#t~short4 := main_~i~0 >= 0; 569#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 570#L17-3 [2018-12-02 09:20:34,058 INFO L796 eck$LassoCheckResult]: Loop: 570#L17-3 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; 580#L17-5 main_#t~short4 := main_~i~0 >= 0; 581#L17-1 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 570#L17-3 [2018-12-02 09:20:34,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:34,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1275302755, now seen corresponding path program 2 times [2018-12-02 09:20:34,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:34,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:34,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:34,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:20:34,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:34,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash 55260, now seen corresponding path program 3 times [2018-12-02 09:20:34,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:34,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:34,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:34,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:34,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:34,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:34,075 INFO L82 PathProgramCache]: Analyzing trace with hash 736351680, now seen corresponding path program 1 times [2018-12-02 09:20:34,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 09:20:34,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 09:20:34,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:34,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 09:20:34,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:20:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:20:34,372 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-12-02 09:20:34,543 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-12-02 09:20:34,544 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 09:20:34,544 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 09:20:34,544 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 09:20:34,545 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 09:20:34,545 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 09:20:34,545 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 09:20:34,545 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 09:20:34,545 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 09:20:34,545 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_true-unreach-call_true-termination.i_Iteration7_Lasso [2018-12-02 09:20:34,545 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 09:20:34,545 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 09:20:34,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,698 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-12-02 09:20:34,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 09:20:34,990 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 09:20:34,991 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 09:20:34,991 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-12-02 09:20:34,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:34,991 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 09:20:34,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:34,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:34,992 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 09:20:34,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:34,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:34,993 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-12-02 09:20:34,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:34,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:34,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:34,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:34,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:20:34,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:34,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 09:20:34,997 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-12-02 09:20:34,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 09:20:34,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 09:20:34,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 09:20:34,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 09:20:34,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 09:20:34,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 09:20:35,006 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 09:20:35,016 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 09:20:35,017 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 09:20:35,017 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 09:20:35,018 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 09:20:35,018 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 09:20:35,018 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 09:20:35,029 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-12-02 09:20:35,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:35,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:35,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:20:35,068 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-12-02 09:20:35,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 09:20:35,106 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2018-12-02 09:20:35,106 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-12-02 09:20:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 09:20:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-12-02 09:20:35,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-02 09:20:35,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:35,107 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 09:20:35,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:35,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:35,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:20:35,141 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-12-02 09:20:35,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 09:20:35,168 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 43 states and 54 transitions. Complement of second has 9 states. [2018-12-02 09:20:35,168 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-12-02 09:20:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 09:20:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-02 09:20:35,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-02 09:20:35,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:35,169 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 09:20:35,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:20:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:35,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:20:35,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:20:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:20:35,205 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-12-02 09:20:35,205 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 09:20:35,236 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 77 states and 107 transitions. Complement of second has 10 states. [2018-12-02 09:20:35,236 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-12-02 09:20:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 09:20:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-12-02 09:20:35,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-02 09:20:35,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:35,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-02 09:20:35,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:35,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-02 09:20:35,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 09:20:35,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 107 transitions. [2018-12-02 09:20:35,239 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 09:20:35,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-12-02 09:20:35,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 09:20:35,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 09:20:35,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 09:20:35,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 09:20:35,240 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:20:35,240 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:20:35,240 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 09:20:35,240 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 09:20:35,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 09:20:35,240 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 09:20:35,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 09:20:35,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 09:20:35 BoogieIcfgContainer [2018-12-02 09:20:35,245 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 09:20:35,246 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:20:35,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:20:35,246 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:20:35,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:20:31" (3/4) ... [2018-12-02 09:20:35,249 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 09:20:35,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:20:35,250 INFO L168 Benchmark]: Toolchain (without parser) took 4290.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -143.5 MB). Peak memory consumption was 178.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:35,250 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:20:35,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.01 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:35,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.21 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:35,252 INFO L168 Benchmark]: Boogie Preprocessor took 49.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:35,252 INFO L168 Benchmark]: RCFGBuilder took 151.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:35,252 INFO L168 Benchmark]: BuchiAutomizer took 3919.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 195.6 MB. Max. memory is 11.5 GB. [2018-12-02 09:20:35,253 INFO L168 Benchmark]: Witness Printer took 3.61 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-12-02 09:20:35,255 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.01 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.21 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 151.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3919.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.1 MB). Peak memory consumption was 195.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 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 * 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 + -1 * v + 17179869178 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 3.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.1s. 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, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 112 SDtfs, 158 SDslu, 84 SDs, 0 SdLazy, 162 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax100 hnf99 lsp85 ukn78 mio100 lsp67 div196 bol100 ite100 ukn100 eq149 hnf60 smp89 dnf152 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 56ms VariablesStem: 6 VariablesLoop: 10 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...