./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 647da5540d24322bf98da85423c1800dc68ed16f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 07:54:43,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 07:54:43,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 07:54:43,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 07:54:43,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 07:54:43,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 07:54:43,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 07:54:43,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 07:54:43,273 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 07:54:43,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 07:54:43,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 07:54:43,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 07:54:43,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 07:54:43,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 07:54:43,275 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 07:54:43,276 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 07:54:43,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 07:54:43,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 07:54:43,278 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 07:54:43,279 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 07:54:43,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 07:54:43,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 07:54:43,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 07:54:43,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 07:54:43,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 07:54:43,282 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 07:54:43,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 07:54:43,283 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 07:54:43,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 07:54:43,284 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 07:54:43,284 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 07:54:43,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 07:54:43,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 07:54:43,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 07:54:43,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 07:54:43,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 07:54:43,286 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 07:54:43,293 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 07:54:43,293 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 07:54:43,294 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 07:54:43,294 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 07:54:43,294 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 07:54:43,294 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 07:54:43,295 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 07:54:43,295 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 07:54:43,295 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 07:54:43,295 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 07:54:43,295 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 07:54:43,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 07:54:43,295 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 07:54:43,295 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 07:54:43,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 07:54:43,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 07:54:43,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 07:54:43,296 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 07:54:43,296 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 07:54:43,296 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 07:54:43,296 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 07:54:43,296 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 07:54:43,296 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 07:54:43,296 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 07:54:43,297 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 07:54:43,297 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 07:54:43,297 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 07:54:43,297 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 07:54:43,297 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 07:54:43,297 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_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647da5540d24322bf98da85423c1800dc68ed16f [2018-12-09 07:54:43,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 07:54:43,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 07:54:43,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 07:54:43,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 07:54:43,324 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 07:54:43,324 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-12-09 07:54:43,359 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/data/2a4fc1ff7/6e5f7e5e59f34fd3a9ed1facd5263b6e/FLAG1646d810a [2018-12-09 07:54:43,798 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 07:54:43,799 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-12-09 07:54:43,802 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/data/2a4fc1ff7/6e5f7e5e59f34fd3a9ed1facd5263b6e/FLAG1646d810a [2018-12-09 07:54:43,810 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/data/2a4fc1ff7/6e5f7e5e59f34fd3a9ed1facd5263b6e [2018-12-09 07:54:43,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 07:54:43,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 07:54:43,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 07:54:43,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 07:54:43,816 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 07:54:43,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:43,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3d1faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43, skipping insertion in model container [2018-12-09 07:54:43,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:43,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 07:54:43,831 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 07:54:43,917 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:54:43,923 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 07:54:43,933 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:54:43,942 INFO L195 MainTranslator]: Completed translation [2018-12-09 07:54:43,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43 WrapperNode [2018-12-09 07:54:43,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 07:54:43,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 07:54:43,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 07:54:43,943 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 07:54:43,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:43,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:43,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 07:54:43,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 07:54:43,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 07:54:43,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 07:54:43,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:43,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:43,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:43,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:44,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:44,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:44,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... [2018-12-09 07:54:44,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 07:54:44,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 07:54:44,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 07:54:44,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 07:54:44,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/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-09 07:54:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 07:54:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 07:54:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2018-12-09 07:54:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-12-09 07:54:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 07:54:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 07:54:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 07:54:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 07:54:44,164 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 07:54:44,164 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 07:54:44,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:54:44 BoogieIcfgContainer [2018-12-09 07:54:44,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 07:54:44,165 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 07:54:44,165 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 07:54:44,167 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 07:54:44,168 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 07:54:44,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 07:54:43" (1/3) ... [2018-12-09 07:54:44,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ad519c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 07:54:44, skipping insertion in model container [2018-12-09 07:54:44,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 07:54:44,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:54:43" (2/3) ... [2018-12-09 07:54:44,169 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ad519c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 07:54:44, skipping insertion in model container [2018-12-09 07:54:44,169 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 07:54:44,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:54:44" (3/3) ... [2018-12-09 07:54:44,170 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive_true-termination.c.i [2018-12-09 07:54:44,203 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 07:54:44,204 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 07:54:44,204 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 07:54:44,204 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 07:54:44,204 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 07:54:44,204 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 07:54:44,204 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 07:54:44,204 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 07:54:44,204 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 07:54:44,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-09 07:54:44,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 07:54:44,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:44,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:44,233 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 07:54:44,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 07:54:44,234 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 07:54:44,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-12-09 07:54:44,235 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-09 07:54:44,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:44,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:44,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 07:54:44,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 07:54:44,242 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 6#L28true assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 8#L33-3true [2018-12-09 07:54:44,242 INFO L796 eck$LassoCheckResult]: Loop: 8#L33-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 10#L33-2true main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 8#L33-3true [2018-12-09 07:54:44,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:44,246 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2018-12-09 07:54:44,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:44,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:44,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:44,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:44,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2018-12-09 07:54:44,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:44,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:44,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:44,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:44,324 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2018-12-09 07:54:44,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:44,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:44,435 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 07:54:44,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 07:54:44,436 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 07:54:44,436 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 07:54:44,436 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 07:54:44,436 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 07:54:44,436 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 07:54:44,436 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 07:54:44,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-12-09 07:54:44,437 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 07:54:44,437 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 07:54:44,451 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-09 07:54:44,458 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-09 07:54:44,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:44,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:44,516 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-09 07:54:44,518 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-09 07:54:44,619 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 07:54:44,622 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 07:54:44,623 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-09 07:54:44,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:44,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:44,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:44,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:44,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:44,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:44,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:44,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:44,629 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-09 07:54:44,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:44,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:44,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:44,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:44,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:44,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:44,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:44,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:44,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:44,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:44,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:44,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:44,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:44,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:44,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:44,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:44,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:44,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:44,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:44,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:44,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:44,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:44,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:44,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:44,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:44,640 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-09 07:54:44,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:44,640 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:54:44,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:44,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:44,642 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:54:44,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:44,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:44,653 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-09 07:54:44,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:44,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:44,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:44,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:44,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:44,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:44,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:44,665 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-09 07:54:44,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:44,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:44,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:44,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:44,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:44,667 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:44,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:44,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:44,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:44,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:44,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:44,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:44,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:44,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:44,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:44,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:44,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:44,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:44,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:44,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:44,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:44,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:44,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:44,706 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 07:54:44,726 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 07:54:44,726 INFO L444 ModelExtractionUtils]: 11 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-09 07:54:44,728 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 07:54:44,729 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 07:54:44,729 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 07:54:44,730 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-09 07:54:44,735 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 07:54:44,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:44,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:44,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:44,780 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-09 07:54:44,793 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-09 07:54:44,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2018-12-09 07:54:44,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 9 states. [2018-12-09 07:54:44,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 07:54:44,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 07:54:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-12-09 07:54:44,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-09 07:54:44,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:44,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 07:54:44,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:44,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-09 07:54:44,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:44,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-09 07:54:44,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 07:54:44,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-12-09 07:54:44,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 07:54:44,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 07:54:44,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-12-09 07:54:44,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 07:54:44,839 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-09 07:54:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-12-09 07:54:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-09 07:54:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 07:54:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-12-09 07:54:44,856 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-09 07:54:44,856 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-12-09 07:54:44,856 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 07:54:44,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-12-09 07:54:44,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 07:54:44,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:44,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:44,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 07:54:44,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 07:54:44,857 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 126#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 127#L33-3 assume !(main_~i~0 < main_~n~0); 121#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 120#insertionSortENTRY [2018-12-09 07:54:44,857 INFO L796 eck$LassoCheckResult]: Loop: 120#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 123#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 131#L15-6 assume !true; 132#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 122#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 120#insertionSortENTRY [2018-12-09 07:54:44,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2018-12-09 07:54:44,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:44,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:44,887 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-09 07:54:44,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:54:44,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:54:44,889 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 07:54:44,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:44,889 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2018-12-09 07:54:44,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:44,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:44,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:44,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:44,896 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-09 07:54:44,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:54:44,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 07:54:44,896 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 07:54:44,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 07:54:44,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 07:54:44,899 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2018-12-09 07:54:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:54:44,902 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-09 07:54:44,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 07:54:44,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-09 07:54:44,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 07:54:44,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-12-09 07:54:44,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 07:54:44,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 07:54:44,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-09 07:54:44,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 07:54:44,904 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-09 07:54:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-09 07:54:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-09 07:54:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 07:54:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-09 07:54:44,905 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-09 07:54:44,905 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-09 07:54:44,905 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 07:54:44,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-09 07:54:44,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 07:54:44,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:44,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:44,906 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 07:54:44,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:44,906 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 162#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 163#L33-3 assume !(main_~i~0 < main_~n~0); 157#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 156#insertionSortENTRY [2018-12-09 07:54:44,907 INFO L796 eck$LassoCheckResult]: Loop: 156#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 159#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 167#L15-6 #t~short4 := ~j~0 > 0; 160#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 161#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 169#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 158#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 156#insertionSortENTRY [2018-12-09 07:54:44,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2018-12-09 07:54:44,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:44,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:44,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:44,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:44,919 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-09 07:54:44,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:54:44,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:54:44,920 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 07:54:44,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:44,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2018-12-09 07:54:44,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:44,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:45,072 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-12-09 07:54:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:54:45,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:54:45,171 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 07:54:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:54:45,177 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-09 07:54:45,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:54:45,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-12-09 07:54:45,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 07:54:45,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2018-12-09 07:54:45,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 07:54:45,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 07:54:45,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-12-09 07:54:45,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 07:54:45,178 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 07:54:45,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-12-09 07:54:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-09 07:54:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 07:54:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-12-09 07:54:45,180 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-09 07:54:45,180 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-09 07:54:45,180 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 07:54:45,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-12-09 07:54:45,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 07:54:45,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:45,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:45,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:45,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:45,181 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 203#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 199#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 200#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 201#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 202#L33-3 assume !(main_~i~0 < main_~n~0); 195#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 193#insertionSortENTRY [2018-12-09 07:54:45,181 INFO L796 eck$LassoCheckResult]: Loop: 193#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 196#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 204#L15-6 #t~short4 := ~j~0 > 0; 197#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 198#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 206#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 194#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 193#insertionSortENTRY [2018-12-09 07:54:45,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2018-12-09 07:54:45,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:45,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:45,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:45,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:45,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2018-12-09 07:54:45,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:45,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:45,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:45,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:45,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2018-12-09 07:54:45,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:45,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 07:54:45,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:54:45,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:54:45,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:54:45,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:54:45,436 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-12-09 07:54:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:54:45,474 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-09 07:54:45,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:54:45,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-12-09 07:54:45,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 07:54:45,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2018-12-09 07:54:45,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 07:54:45,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 07:54:45,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-12-09 07:54:45,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 07:54:45,476 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-09 07:54:45,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-12-09 07:54:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-09 07:54:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 07:54:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-09 07:54:45,477 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 07:54:45,477 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 07:54:45,477 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 07:54:45,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-09 07:54:45,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 07:54:45,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:45,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:45,478 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:45,478 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:45,478 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 256#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 252#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 253#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 254#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 255#L33-3 assume !(main_~i~0 < main_~n~0); 248#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 247#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 249#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 257#L15-6 #t~short4 := ~j~0 > 0; 250#L15-1 assume !#t~short4; 251#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 261#L15-7 [2018-12-09 07:54:45,478 INFO L796 eck$LassoCheckResult]: Loop: 261#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 258#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 259#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 266#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 263#L15-6 #t~short4 := ~j~0 > 0; 265#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 264#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 261#L15-7 [2018-12-09 07:54:45,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2018-12-09 07:54:45,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:45,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:45,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:45,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2018-12-09 07:54:45,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:45,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:45,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:45,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:45,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2018-12-09 07:54:45,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:45,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:45,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:45,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 07:54:45,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:54:45,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:54:45,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:45,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:54:45,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 07:54:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2018-12-09 07:54:45,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 07:54:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-09 07:54:45,944 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-12-09 07:54:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:54:46,065 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-09 07:54:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 07:54:46,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2018-12-09 07:54:46,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-09 07:54:46,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 27 transitions. [2018-12-09 07:54:46,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-09 07:54:46,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-09 07:54:46,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-12-09 07:54:46,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 07:54:46,067 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-09 07:54:46,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-12-09 07:54:46,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-09 07:54:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 07:54:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-12-09 07:54:46,068 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-09 07:54:46,068 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-09 07:54:46,069 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 07:54:46,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-12-09 07:54:46,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-09 07:54:46,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:46,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:46,070 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:46,070 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:46,070 INFO L794 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 397#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 392#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 393#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 394#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 395#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 396#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 406#L33-3 assume !(main_~i~0 < main_~n~0); 388#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 387#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 389#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 398#L15-6 #t~short4 := ~j~0 > 0; 390#L15-1 assume !#t~short4; 391#L15-3 [2018-12-09 07:54:46,070 INFO L796 eck$LassoCheckResult]: Loop: 391#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 402#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 400#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 401#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 405#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 404#L15-6 #t~short4 := ~j~0 > 0; 408#L15-1 assume !#t~short4; 391#L15-3 [2018-12-09 07:54:46,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:46,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 1 times [2018-12-09 07:54:46,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash -497256520, now seen corresponding path program 1 times [2018-12-09 07:54:46,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:46,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:46,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash 451769787, now seen corresponding path program 1 times [2018-12-09 07:54:46,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:46,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:46,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:46,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 07:54:46,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:54:46,133 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:54:46,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:46,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 07:54:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 07:54:46,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-12-09 07:54:46,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 07:54:46,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 07:54:46,382 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-12-09 07:54:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:54:46,459 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-09 07:54:46,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 07:54:46,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-12-09 07:54:46,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 07:54:46,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-12-09 07:54:46,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 07:54:46,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-09 07:54:46,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-12-09 07:54:46,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 07:54:46,461 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-09 07:54:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-12-09 07:54:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-12-09 07:54:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 07:54:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-12-09 07:54:46,462 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-09 07:54:46,462 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-09 07:54:46,462 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 07:54:46,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-12-09 07:54:46,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-09 07:54:46,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:46,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:46,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:46,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:46,463 INFO L794 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 532#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 533#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 534#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 535#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 536#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 538#L33-3 assume !(main_~i~0 < main_~n~0); 528#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 527#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 529#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 539#L15-6 #t~short4 := ~j~0 > 0; 530#L15-1 assume !#t~short4; 531#L15-3 [2018-12-09 07:54:46,463 INFO L796 eck$LassoCheckResult]: Loop: 531#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 543#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 540#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 541#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 550#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 549#L15-6 #t~short4 := ~j~0 > 0; 547#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 546#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 544#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 545#L15-6 #t~short4 := ~j~0 > 0; 548#L15-1 assume !#t~short4; 531#L15-3 [2018-12-09 07:54:46,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:46,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 2 times [2018-12-09 07:54:46,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:46,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:46,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:46,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:46,475 INFO L82 PathProgramCache]: Analyzing trace with hash -346675363, now seen corresponding path program 1 times [2018-12-09 07:54:46,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:46,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:46,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:46,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 1 times [2018-12-09 07:54:46,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:46,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:46,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:46,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:46,784 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-12-09 07:54:47,119 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-12-09 07:54:47,156 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 07:54:47,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 07:54:47,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 07:54:47,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 07:54:47,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 07:54:47,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 07:54:47,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 07:54:47,157 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 07:54:47,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration7_Lasso [2018-12-09 07:54:47,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 07:54:47,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 07:54:47,160 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-09 07:54:47,161 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-09 07:54:47,162 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-09 07:54:47,163 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-09 07:54:47,164 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-09 07:54:47,165 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-09 07:54:47,167 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-09 07:54:47,167 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-09 07:54:47,168 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-09 07:54:47,169 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-09 07:54:47,170 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-09 07:54:47,416 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-12-09 07:54:47,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,418 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-09 07:54:47,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,427 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-09 07:54:47,427 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-09 07:54:47,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:47,727 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 07:54:47,727 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 07:54:47,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:47,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:47,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:47,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:47,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,729 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-09 07:54:47,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:47,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:47,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:47,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,730 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-09 07:54:47,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:47,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:47,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,732 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-09 07:54:47,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:47,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:47,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:47,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,733 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-09 07:54:47,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:47,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:47,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:47,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,734 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-09 07:54:47,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:47,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:47,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:47,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:47,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:47,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:47,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:47,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:47,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:47,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:47,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:47,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,737 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-09 07:54:47,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:47,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:47,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:47,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,738 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-09 07:54:47,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:47,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:47,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:47,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,739 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-09 07:54:47,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:47,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:47,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,743 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-09 07:54:47,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:54:47,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,744 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:54:47,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:47,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:47,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:47,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:47,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:47,748 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-09 07:54:47,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:47,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:47,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:47,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:47,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:47,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:47,772 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 07:54:47,781 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 07:54:47,781 INFO L444 ModelExtractionUtils]: 27 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 07:54:47,782 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 07:54:47,782 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 07:54:47,782 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 07:54:47,782 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~i) = -2*insertionSort_~i + 1 Supporting invariants [] [2018-12-09 07:54:47,793 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-12-09 07:54:47,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:47,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:47,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:54:47,906 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-09 07:54:47,906 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-12-09 07:54:48,161 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 153 states and 185 transitions. Complement of second has 70 states. [2018-12-09 07:54:48,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-12-09 07:54:48,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 07:54:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 38 transitions. [2018-12-09 07:54:48,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 13 letters. Loop has 11 letters. [2018-12-09 07:54:48,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:48,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 24 letters. Loop has 11 letters. [2018-12-09 07:54:48,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:48,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 38 transitions. Stem has 13 letters. Loop has 22 letters. [2018-12-09 07:54:48,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:48,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 185 transitions. [2018-12-09 07:54:48,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-09 07:54:48,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 185 transitions. [2018-12-09 07:54:48,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-12-09 07:54:48,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-12-09 07:54:48,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 185 transitions. [2018-12-09 07:54:48,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 07:54:48,169 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 185 transitions. [2018-12-09 07:54:48,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 185 transitions. [2018-12-09 07:54:48,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 45. [2018-12-09 07:54:48,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 07:54:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-12-09 07:54:48,173 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-12-09 07:54:48,173 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-12-09 07:54:48,173 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 07:54:48,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 55 transitions. [2018-12-09 07:54:48,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 07:54:48,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:48,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:48,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:48,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:48,174 INFO L794 eck$LassoCheckResult]: Stem: 927#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 921#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 915#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 916#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 918#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 919#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 920#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 922#L33-3 assume !(main_~i~0 < main_~n~0); 911#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 917#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 942#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 941#L15-6 #t~short4 := ~j~0 > 0; 910#L15-1 assume !#t~short4; 912#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 928#L15-7 [2018-12-09 07:54:48,174 INFO L796 eck$LassoCheckResult]: Loop: 928#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 905#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 904#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 906#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 923#L15-6 #t~short4 := ~j~0 > 0; 924#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 945#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 928#L15-7 [2018-12-09 07:54:48,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2018-12-09 07:54:48,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:48,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:48,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:48,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:48,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2018-12-09 07:54:48,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:48,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:48,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:48,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:48,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:48,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2018-12-09 07:54:48,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:48,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:48,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:48,703 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 07:54:48,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 07:54:48,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 07:54:48,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 07:54:48,703 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 07:54:48,703 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 07:54:48,703 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 07:54:48,703 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 07:54:48,703 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-12-09 07:54:48,703 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 07:54:48,703 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 07:54:48,705 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-09 07:54:48,707 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-09 07:54:48,708 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-09 07:54:48,709 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-09 07:54:48,710 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-09 07:54:48,716 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-09 07:54:48,717 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-09 07:54:48,718 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-09 07:54:48,959 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-09 07:54:48,959 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-09 07:54:48,960 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-09 07:54:48,961 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-09 07:54:48,962 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-09 07:54:48,963 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-09 07:54:48,964 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-09 07:54:48,965 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-09 07:54:48,966 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-09 07:54:48,967 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-09 07:54:48,967 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-09 07:54:48,968 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-09 07:54:48,969 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-09 07:54:48,970 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-09 07:54:48,971 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-09 07:54:48,972 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-09 07:54:48,973 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-09 07:54:49,257 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 07:54:49,257 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 07:54:49,258 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-09 07:54:49,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:49,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:49,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:49,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,259 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-09 07:54:49,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:49,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:49,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:49,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,260 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-09 07:54:49,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:49,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:49,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:49,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,261 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-09 07:54:49,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:49,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:49,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:49,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,262 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-09 07:54:49,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:49,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:49,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,264 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-09 07:54:49,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:49,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:49,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:49,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:49,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:49,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:49,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:49,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,266 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-09 07:54:49,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:49,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:49,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,269 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-09 07:54:49,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,269 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:54:49,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,270 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:54:49,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:49,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,272 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-09 07:54:49,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,274 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:49,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:49,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,277 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-09 07:54:49,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:49,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:49,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:49,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:49,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:49,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:49,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:49,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:49,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:49,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:49,294 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 07:54:49,312 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 07:54:49,312 INFO L444 ModelExtractionUtils]: 21 out of 31 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-09 07:54:49,313 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 07:54:49,313 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 07:54:49,313 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 07:54:49,313 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_#in~array.base)_2, insertionSort_~array.offset, insertionSort_~j~0) = 1*v_rep(select #length insertionSort_#in~array.base)_2 - 1*insertionSort_~array.offset - 4*insertionSort_~j~0 Supporting invariants [] [2018-12-09 07:54:49,332 INFO L297 tatePredicateManager]: 6 out of 8 supporting invariants were superfluous and have been removed [2018-12-09 07:54:49,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 07:54:49,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:49,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:49,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:49,449 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-09 07:54:49,450 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2018-12-09 07:54:49,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-12-09 07:54:49,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13. Second operand 8 states. Result 81 states and 95 transitions. Complement of second has 17 states. [2018-12-09 07:54:49,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 07:54:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 07:54:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-12-09 07:54:49,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 14 letters. Loop has 7 letters. [2018-12-09 07:54:49,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:49,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-09 07:54:49,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:49,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 14 letters. Loop has 14 letters. [2018-12-09 07:54:49,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:49,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 95 transitions. [2018-12-09 07:54:49,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 07:54:49,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 69 states and 81 transitions. [2018-12-09 07:54:49,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 07:54:49,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-09 07:54:49,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 81 transitions. [2018-12-09 07:54:49,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 07:54:49,549 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-12-09 07:54:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 81 transitions. [2018-12-09 07:54:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-12-09 07:54:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 07:54:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-12-09 07:54:49,553 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-09 07:54:49,553 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-09 07:54:49,553 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 07:54:49,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2018-12-09 07:54:49,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 07:54:49,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:49,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:49,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:49,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:49,554 INFO L794 eck$LassoCheckResult]: Stem: 1198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1191#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1184#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1185#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1188#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1189#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1190#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1207#L33-3 assume !(main_~i~0 < main_~n~0); 1186#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1187#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1217#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1214#L15-6 #t~short4 := ~j~0 > 0; 1210#L15-1 assume !#t~short4; 1209#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1199#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1193#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1226#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1223#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1221#L15-6 #t~short4 := ~j~0 > 0; 1220#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1201#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1202#L15-5 [2018-12-09 07:54:49,555 INFO L796 eck$LassoCheckResult]: Loop: 1202#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1192#L15-6 #t~short4 := ~j~0 > 0; 1194#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1232#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1208#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1175#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1174#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1176#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1205#L15-6 #t~short4 := ~j~0 > 0; 1180#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1181#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1202#L15-5 [2018-12-09 07:54:49,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961465, now seen corresponding path program 1 times [2018-12-09 07:54:49,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:49,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:49,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:49,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:49,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:49,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:49,573 INFO L82 PathProgramCache]: Analyzing trace with hash -148104591, now seen corresponding path program 1 times [2018-12-09 07:54:49,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:49,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:49,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:49,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:49,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:49,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:49,588 INFO L82 PathProgramCache]: Analyzing trace with hash -670188039, now seen corresponding path program 2 times [2018-12-09 07:54:49,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:49,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:49,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 07:54:49,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:54:49,629 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:54:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 07:54:49,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 07:54:49,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:54:49,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 07:54:49,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 07:54:49,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-12-09 07:54:49,994 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-12-09 07:54:50,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 07:54:50,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-12-09 07:54:50,040 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-12-09 07:54:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:54:50,144 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-12-09 07:54:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 07:54:50,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 110 transitions. [2018-12-09 07:54:50,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 07:54:50,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 91 states and 105 transitions. [2018-12-09 07:54:50,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-09 07:54:50,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-09 07:54:50,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 105 transitions. [2018-12-09 07:54:50,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 07:54:50,147 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-12-09 07:54:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 105 transitions. [2018-12-09 07:54:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-12-09 07:54:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 07:54:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-12-09 07:54:50,150 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-12-09 07:54:50,150 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-12-09 07:54:50,150 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 07:54:50,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 91 transitions. [2018-12-09 07:54:50,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 07:54:50,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:50,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:50,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:50,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:50,151 INFO L794 eck$LassoCheckResult]: Stem: 1489#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1482#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1475#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1476#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1479#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1480#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1481#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1501#L33-3 assume !(main_~i~0 < main_~n~0); 1477#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1478#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1510#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1509#L15-6 #t~short4 := ~j~0 > 0; 1507#L15-1 assume !#t~short4; 1504#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1505#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1473#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1534#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1533#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1532#L15-6 #t~short4 := ~j~0 > 0; 1531#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1530#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1528#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1527#L15-6 #t~short4 := ~j~0 > 0; 1519#L15-1 assume !#t~short4; 1513#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1494#L15-7 [2018-12-09 07:54:50,152 INFO L796 eck$LassoCheckResult]: Loop: 1494#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1465#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1464#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1466#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1483#L15-6 #t~short4 := ~j~0 > 0; 1470#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1471#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1494#L15-7 [2018-12-09 07:54:50,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:50,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1796534224, now seen corresponding path program 3 times [2018-12-09 07:54:50,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:50,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:50,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:50,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:50,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 5 times [2018-12-09 07:54:50,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:50,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:50,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:50,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:50,171 INFO L82 PathProgramCache]: Analyzing trace with hash 9870329, now seen corresponding path program 4 times [2018-12-09 07:54:50,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:50,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 07:54:50,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 07:54:50,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94598cfe-9130-4b30-9778-8c46a50793db/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 07:54:50,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 07:54:50,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 07:54:50,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 07:54:50,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 07:54:50,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 07:54:50,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-12-09 07:54:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 07:54:50,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-12-09 07:54:50,582 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. cyclomatic complexity: 18 Second operand 23 states. [2018-12-09 07:54:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:54:50,745 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-12-09 07:54:50,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 07:54:50,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 136 transitions. [2018-12-09 07:54:50,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 07:54:50,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 81 states and 94 transitions. [2018-12-09 07:54:50,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-09 07:54:50,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-09 07:54:50,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 94 transitions. [2018-12-09 07:54:50,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 07:54:50,747 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-12-09 07:54:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 94 transitions. [2018-12-09 07:54:50,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-09 07:54:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 07:54:50,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2018-12-09 07:54:50,749 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-12-09 07:54:50,749 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-12-09 07:54:50,750 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 07:54:50,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 93 transitions. [2018-12-09 07:54:50,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-09 07:54:50,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:50,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:50,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:50,750 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:50,751 INFO L794 eck$LassoCheckResult]: Stem: 1829#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1822#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 1817#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 1818#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1819#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1820#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1821#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1851#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 1842#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1841#L33-3 assume !(main_~i~0 < main_~n~0); 1805#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1804#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1806#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1850#L15-6 #t~short4 := ~j~0 > 0; 1848#L15-1 assume !#t~short4; 1844#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1832#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1808#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1807#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1809#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1882#L15-6 #t~short4 := ~j~0 > 0; 1881#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1880#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 1879#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1853#L15-6 #t~short4 := ~j~0 > 0; 1849#L15-1 assume !#t~short4; 1845#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1843#L15-7 [2018-12-09 07:54:50,751 INFO L796 eck$LassoCheckResult]: Loop: 1843#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1812#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1828#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1838#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 1823#L15-6 #t~short4 := ~j~0 > 0; 1824#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 1860#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1843#L15-7 [2018-12-09 07:54:50,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:50,751 INFO L82 PathProgramCache]: Analyzing trace with hash 17685426, now seen corresponding path program 5 times [2018-12-09 07:54:50,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:50,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:50,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:50,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 6 times [2018-12-09 07:54:50,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:50,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:50,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:50,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:50,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:50,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1495415351, now seen corresponding path program 6 times [2018-12-09 07:54:50,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:50,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:50,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:51,331 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2018-12-09 07:54:51,707 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-12-09 07:54:51,917 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-09 07:54:52,198 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-12-09 07:54:52,240 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 07:54:52,240 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 07:54:52,240 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 07:54:52,240 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 07:54:52,240 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 07:54:52,240 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 07:54:52,240 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 07:54:52,240 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 07:54:52,240 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration11_Lasso [2018-12-09 07:54:52,240 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 07:54:52,241 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 07:54:52,242 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-09 07:54:52,244 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-09 07:54:52,244 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-09 07:54:52,245 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-09 07:54:52,247 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-09 07:54:52,247 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-09 07:54:52,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:52,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:52,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:52,448 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-09 07:54:52,449 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-09 07:54:52,450 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-09 07:54:52,451 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-09 07:54:52,452 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-09 07:54:52,453 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-09 07:54:52,455 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-09 07:54:52,455 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-09 07:54:52,456 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-09 07:54:52,457 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-09 07:54:52,457 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-09 07:54:52,458 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-09 07:54:52,459 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-09 07:54:52,460 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-09 07:54:52,460 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-09 07:54:52,737 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 07:54:52,737 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 07:54:52,738 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-09 07:54:52,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:52,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:52,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:52,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,739 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-09 07:54:52,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:52,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:52,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:52,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,740 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-09 07:54:52,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:52,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:52,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:52,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:52,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:52,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:52,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:52,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:52,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:52,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:52,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,743 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-09 07:54:52,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:52,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:52,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:52,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:52,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:52,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:52,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:52,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,745 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-09 07:54:52,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:52,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:52,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:52,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,746 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-09 07:54:52,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:52,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:52,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:52,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:52,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:52,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:52,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,748 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-09 07:54:52,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:52,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:52,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:52,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:52,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:52,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:52,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,755 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-09 07:54:52,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,755 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 07:54:52,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,756 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 07:54:52,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:52,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,758 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-09 07:54:52,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:52,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:52,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:52,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 07:54:52,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:52,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:52,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:52,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:52,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:52,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:52,796 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 07:54:52,809 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 07:54:52,809 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-09 07:54:52,809 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 07:54:52,809 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 07:54:52,809 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 07:54:52,809 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_3, insertionSort_~i, insertionSort_~array.offset) = 1*v_rep(select #length insertionSort_~array.base)_3 - 4*insertionSort_~i - 1*insertionSort_~array.offset Supporting invariants [] [2018-12-09 07:54:52,825 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-09 07:54:52,825 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 07:54:52,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:52,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:52,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:54:52,890 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-09 07:54:52,890 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-12-09 07:54:52,947 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 137 states and 163 transitions. Complement of second has 14 states. [2018-12-09 07:54:52,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-09 07:54:52,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 07:54:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-12-09 07:54:52,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2018-12-09 07:54:52,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:52,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2018-12-09 07:54:52,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:52,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2018-12-09 07:54:52,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:52,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 163 transitions. [2018-12-09 07:54:52,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 07:54:52,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 92 states and 107 transitions. [2018-12-09 07:54:52,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-09 07:54:52,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 07:54:52,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 107 transitions. [2018-12-09 07:54:52,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 07:54:52,951 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 107 transitions. [2018-12-09 07:54:52,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 107 transitions. [2018-12-09 07:54:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-12-09 07:54:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-09 07:54:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-12-09 07:54:52,954 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-12-09 07:54:52,954 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-12-09 07:54:52,954 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 07:54:52,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 100 transitions. [2018-12-09 07:54:52,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 07:54:52,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 07:54:52,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 07:54:52,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:54:52,956 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 07:54:52,956 INFO L794 eck$LassoCheckResult]: Stem: 2219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2214#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet7;havoc main_#t~nondet7; 2209#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 2210#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2211#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2212#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2213#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2215#L33-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet10, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet10; 2235#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2234#L33-3 assume !(main_~i~0 < main_~n~0); 2198#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2197#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2199#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2229#L15-6 #t~short4 := ~j~0 > 0; 2236#L15-1 assume !#t~short4; 2225#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2226#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2207#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2275#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2274#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2271#L15-6 #t~short4 := ~j~0 > 0; 2206#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2208#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2277#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2201#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2200#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2202#L10 assume ~i < ~size;havoc ~j~0;call #t~mem1 := read~int(~array.base, ~array.offset + 4 * ~i, 4);~temp~0 := #t~mem1;havoc #t~mem1;~j~0 := ~i; 2273#L15-6 #t~short4 := ~j~0 > 0; 2203#L15-1 [2018-12-09 07:54:52,956 INFO L796 eck$LassoCheckResult]: Loop: 2203#L15-1 assume #t~short4;call #t~mem3 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);#t~short4 := #t~mem3 > ~temp~0; 2205#L15-3 assume !!#t~short4;havoc #t~short4;havoc #t~mem3;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * (~j~0 - 1), 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~j~0, 4);havoc #t~mem5; 2232#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2216#L15-6 #t~short4 := ~j~0 > 0; 2203#L15-1 [2018-12-09 07:54:52,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:52,956 INFO L82 PathProgramCache]: Analyzing trace with hash 496161610, now seen corresponding path program 3 times [2018-12-09 07:54:52,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:52,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:52,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:52,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:52,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:52,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:52,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2018-12-09 07:54:52,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:52,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:52,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:52,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:54:52,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:52,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1509363707, now seen corresponding path program 7 times [2018-12-09 07:54:52,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 07:54:52,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 07:54:52,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:52,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:54:52,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:54:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:54:53,656 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-12-09 07:54:53,812 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-12-09 07:54:54,028 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-12-09 07:54:54,063 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 07:54:54,063 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 07:54:54,063 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 07:54:54,063 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 07:54:54,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 07:54:54,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 07:54:54,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 07:54:54,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 07:54:54,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration12_Lasso [2018-12-09 07:54:54,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 07:54:54,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 07:54:54,065 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-09 07:54:54,067 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-09 07:54:54,068 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-09 07:54:54,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 07:54:54,210 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-09 07:54:54,211 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-09 07:54:54,212 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-09 07:54:54,213 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-09 07:54:54,213 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-09 07:54:54,214 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-09 07:54:54,215 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-09 07:54:54,216 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-09 07:54:54,217 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-09 07:54:54,218 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-09 07:54:54,219 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-09 07:54:54,219 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-09 07:54:54,220 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-09 07:54:54,221 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-09 07:54:54,222 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-09 07:54:54,223 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-09 07:54:54,223 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-09 07:54:54,224 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-09 07:54:54,225 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-09 07:54:54,462 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 07:54:54,462 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 07:54:54,462 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-09 07:54:54,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:54,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:54,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:54,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:54,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:54,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:54,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:54,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:54,463 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-09 07:54:54,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:54,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:54,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:54,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:54,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:54,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:54,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:54,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:54,464 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-09 07:54:54,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:54,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:54,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:54,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:54,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:54,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:54,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:54,465 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-09 07:54:54,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:54,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:54,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:54,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:54,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:54,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:54,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:54,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:54,466 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-09 07:54:54,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:54,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:54,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:54,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:54,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 07:54:54,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 07:54:54,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:54,470 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-09 07:54:54,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:54,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:54,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:54,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:54,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:54,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:54,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:54,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:54,471 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-09 07:54:54,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:54,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 07:54:54,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:54,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 07:54:54,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:54,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 07:54:54,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 07:54:54,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 07:54:54,472 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-09 07:54:54,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 07:54:54,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 07:54:54,472 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 07:54:54,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 07:54:54,474 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-09 07:54:54,474 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-09 07:54:54,501 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 07:54:54,519 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 07:54:54,519 INFO L444 ModelExtractionUtils]: 46 out of 56 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-12-09 07:54:54,519 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 07:54:54,520 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-09 07:54:54,520 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 07:54:54,520 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~array.offset, insertionSort_~j~0) = 1*insertionSort_~array.offset + 4*insertionSort_~j~0 Supporting invariants [] [2018-12-09 07:54:54,529 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-09 07:54:54,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:54,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:54,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:54,583 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-09 07:54:54,584 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-09 07:54:54,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-12-09 07:54:54,588 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 90 states and 105 transitions. Complement of second has 8 states. [2018-12-09 07:54:54,589 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-09 07:54:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 07:54:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-09 07:54:54,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-09 07:54:54,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:54,589 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 07:54:54,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:54,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:54,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:54,655 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-09 07:54:54,655 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-09 07:54:54,655 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-12-09 07:54:54,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 90 states and 105 transitions. Complement of second has 8 states. [2018-12-09 07:54:54,662 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-09 07:54:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 07:54:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-09 07:54:54,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-09 07:54:54,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:54,662 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 07:54:54,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:54:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:54,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:54:54,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 07:54:54,705 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-09 07:54:54,705 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-09 07:54:54,705 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-12-09 07:54:54,718 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21. Second operand 5 states. Result 131 states and 157 transitions. Complement of second has 9 states. [2018-12-09 07:54:54,718 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-09 07:54:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 07:54:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-12-09 07:54:54,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 4 letters. [2018-12-09 07:54:54,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:54,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 4 letters. [2018-12-09 07:54:54,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:54,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 8 letters. [2018-12-09 07:54:54,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 07:54:54,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 157 transitions. [2018-12-09 07:54:54,721 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 07:54:54,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 0 states and 0 transitions. [2018-12-09 07:54:54,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 07:54:54,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 07:54:54,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 07:54:54,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 07:54:54,721 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 07:54:54,721 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 07:54:54,721 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 07:54:54,721 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 07:54:54,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 07:54:54,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 07:54:54,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 07:54:54,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 07:54:54 BoogieIcfgContainer [2018-12-09 07:54:54,727 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 07:54:54,727 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 07:54:54,727 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 07:54:54,727 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 07:54:54,728 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:54:44" (3/4) ... [2018-12-09 07:54:54,730 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 07:54:54,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 07:54:54,731 INFO L168 Benchmark]: Toolchain (without parser) took 10919.05 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 471.9 MB). Free memory was 953.3 MB in the beginning and 1.3 GB in the end (delta: -383.4 MB). Peak memory consumption was 88.4 MB. Max. memory is 11.5 GB. [2018-12-09 07:54:54,732 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:54:54,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.70 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:54:54,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.86 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:54:54,733 INFO L168 Benchmark]: Boogie Preprocessor took 44.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-09 07:54:54,733 INFO L168 Benchmark]: RCFGBuilder took 154.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-12-09 07:54:54,733 INFO L168 Benchmark]: BuchiAutomizer took 10562.01 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 369.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -254.4 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:54:54,734 INFO L168 Benchmark]: Witness Printer took 3.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 07:54:54,736 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 129.70 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 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 21.86 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 154.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10562.01 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 369.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -254.4 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 12 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -1 * array + -4 * j and consists of 8 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -4 * i + -1 * array and consists of 6 locations. One nondeterministic module has affine ranking function array + 4 * j and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.5s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 8.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 146 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 85 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/3 HoareTripleCheckerStatistics: 180 SDtfs, 271 SDslu, 400 SDs, 0 SdLazy, 707 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU1 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital241 mio100 ax100 hnf99 lsp93 ukn81 mio100 lsp58 div100 bol101 ite100 ukn100 eq168 hnf88 smp95 dnf122 smp92 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 48ms VariablesStem: 10 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...