./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/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_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/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-aa41828 [2018-11-23 13:19:40,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:19:40,150 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:19:40,158 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:19:40,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:19:40,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:19:40,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:19:40,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:19:40,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:19:40,162 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:19:40,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:19:40,163 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:19:40,164 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:19:40,164 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:19:40,165 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:19:40,166 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:19:40,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:19:40,167 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:19:40,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:19:40,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:19:40,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:19:40,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:19:40,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:19:40,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:19:40,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:19:40,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:19:40,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:19:40,174 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:19:40,175 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:19:40,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:19:40,175 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:19:40,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:19:40,176 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:19:40,176 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:19:40,177 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:19:40,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:19:40,177 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:19:40,187 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:19:40,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:19:40,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:19:40,188 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:19:40,188 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:19:40,188 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:19:40,188 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:19:40,189 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:19:40,189 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:19:40,189 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:19:40,189 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:19:40,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:19:40,189 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:19:40,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:19:40,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:19:40,190 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:19:40,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:19:40,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:19:40,190 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:19:40,190 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:19:40,190 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:19:40,190 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:19:40,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:19:40,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:19:40,191 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:19:40,191 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:19:40,191 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:19:40,191 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:19:40,192 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:19:40,192 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_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647da5540d24322bf98da85423c1800dc68ed16f [2018-11-23 13:19:40,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:19:40,222 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:19:40,225 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:19:40,226 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:19:40,226 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:19:40,227 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-23 13:19:40,273 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/data/66c817446/f9ce95efe7e3431aa55effe16a946452/FLAGb8478439f [2018-11-23 13:19:40,662 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:19:40,663 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive_true-termination.c.i [2018-11-23 13:19:40,669 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/data/66c817446/f9ce95efe7e3431aa55effe16a946452/FLAGb8478439f [2018-11-23 13:19:40,679 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/data/66c817446/f9ce95efe7e3431aa55effe16a946452 [2018-11-23 13:19:40,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:19:40,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:19:40,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:19:40,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:19:40,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:19:40,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248de34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40, skipping insertion in model container [2018-11-23 13:19:40,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:19:40,711 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:19:40,843 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:19:40,851 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:19:40,866 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:19:40,879 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:19:40,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40 WrapperNode [2018-11-23 13:19:40,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:19:40,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:19:40,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:19:40,880 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:19:40,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:19:40,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:19:40,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:19:40,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:19:40,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... [2018-11-23 13:19:40,971 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:19:40,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:19:40,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:19:40,971 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:19:40,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:19:41,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:19:41,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:19:41,024 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2018-11-23 13:19:41,024 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-11-23 13:19:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:19:41,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:19:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:19:41,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:19:41,194 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:19:41,195 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:19:41,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:19:41 BoogieIcfgContainer [2018-11-23 13:19:41,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:19:41,196 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:19:41,196 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:19:41,200 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:19:41,201 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:19:41,201 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:19:40" (1/3) ... [2018-11-23 13:19:41,202 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585d859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:19:41, skipping insertion in model container [2018-11-23 13:19:41,202 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:19:41,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:19:40" (2/3) ... [2018-11-23 13:19:41,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@585d859a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:19:41, skipping insertion in model container [2018-11-23 13:19:41,203 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:19:41,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:19:41" (3/3) ... [2018-11-23 13:19:41,205 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive_true-termination.c.i [2018-11-23 13:19:41,267 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:19:41,268 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:19:41,268 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:19:41,268 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:19:41,268 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:19:41,268 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:19:41,269 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:19:41,269 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:19:41,270 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:19:41,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 13:19:41,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:19:41,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:41,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:41,318 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:19:41,318 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:19:41,318 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:19:41,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 13:19:41,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 13:19:41,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:41,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:41,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:19:41,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 13:19:41,329 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-11-23 13:19:41,330 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-11-23 13:19:41,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2018-11-23 13:19:41,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:41,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:41,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:41,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:41,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:41,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2018-11-23 13:19:41,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:41,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:41,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:41,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:41,448 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2018-11-23 13:19:41,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:41,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:41,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:41,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:41,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:41,610 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:19:41,611 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:19:41,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:19:41,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:19:41,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:19:41,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:19:41,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:19:41,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:19:41,612 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-11-23 13:19:41,612 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:19:41,613 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:19:41,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:41,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:41,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-11-23 13:19:41,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:41,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:41,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:41,875 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:19:41,878 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:19:41,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:41,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:41,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:41,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:41,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:41,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:41,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:41,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:41,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:41,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:41,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:41,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:41,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:41,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:41,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:41,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:41,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:41,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:41,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:41,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:41,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:41,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:41,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:41,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:41,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:41,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:19:41,969 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 13:19:41,969 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 13:19:41,971 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:19:41,974 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:19:41,974 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:19:41,974 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_main_~a~0.offset) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_main_~a~0.offset Supporting invariants [] [2018-11-23 13:19:41,997 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 13:19:42,006 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:19:42,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:42,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:42,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:42,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:19:42,107 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2018-11-23 13:19:42,166 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-11-23 13:19:42,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:19:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:19:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-23 13:19:42,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-23 13:19:42,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:42,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-23 13:19:42,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:42,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-23 13:19:42,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:42,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-23 13:19:42,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:19:42,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2018-11-23 13:19:42,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 13:19:42,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 13:19:42,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-23 13:19:42,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:19:42,180 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:19:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-23 13:19:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:19:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:19:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2018-11-23 13:19:42,198 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:19:42,198 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-23 13:19:42,198 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:19:42,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2018-11-23 13:19:42,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:19:42,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:42,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:42,199 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:19:42,199 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:19:42,200 INFO L794 eck$LassoCheckResult]: Stem: 138#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 135#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; 131#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; 132#L33-3 assume !(main_~i~0 < main_~n~0); 127#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 125#insertionSortENTRY [2018-11-23 13:19:42,200 INFO L796 eck$LassoCheckResult]: Loop: 125#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 128#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; 136#L15-6 assume !true; 137#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 126#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 125#insertionSortENTRY [2018-11-23 13:19:42,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2018-11-23 13:19:42,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:42,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:42,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:42,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:19:42,245 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:19:42,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2018-11-23 13:19:42,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:42,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:42,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:19:42,252 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:19:42,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:19:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:19:42,255 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2018-11-23 13:19:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:42,258 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-23 13:19:42,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:19:42,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-23 13:19:42,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:19:42,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 13:19:42,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 13:19:42,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 13:19:42,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-23 13:19:42,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:19:42,260 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 13:19:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-23 13:19:42,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:19:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:19:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 13:19:42,262 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 13:19:42,262 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 13:19:42,262 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:19:42,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-23 13:19:42,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:19:42,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:42,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:42,263 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 13:19:42,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:42,263 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 171#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; 167#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; 168#L33-3 assume !(main_~i~0 < main_~n~0); 163#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 161#insertionSortENTRY [2018-11-23 13:19:42,263 INFO L796 eck$LassoCheckResult]: Loop: 161#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 164#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; 172#L15-6 #t~short4 := ~j~0 > 0; 165#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; 166#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 174#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 162#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 161#insertionSortENTRY [2018-11-23 13:19:42,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2018-11-23 13:19:42,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:42,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:42,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:19:42,291 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:19:42,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2018-11-23 13:19:42,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,454 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-23 13:19:42,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:19:42,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:19:42,551 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 13:19:42,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:42,558 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-23 13:19:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:19:42,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-11-23 13:19:42,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:19:42,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2018-11-23 13:19:42,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 13:19:42,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 13:19:42,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-23 13:19:42,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:19:42,561 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 13:19:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-23 13:19:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:19:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:19:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-23 13:19:42,563 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-23 13:19:42,563 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-23 13:19:42,563 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:19:42,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-23 13:19:42,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:19:42,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:42,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:42,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:42,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:42,565 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 208#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; 204#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; 205#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; 206#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 207#L33-3 assume !(main_~i~0 < main_~n~0); 200#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 198#insertionSortENTRY [2018-11-23 13:19:42,565 INFO L796 eck$LassoCheckResult]: Loop: 198#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 201#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; 209#L15-6 #t~short4 := ~j~0 > 0; 202#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; 203#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 211#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 199#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 198#insertionSortENTRY [2018-11-23 13:19:42,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,569 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2018-11-23 13:19:42,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:42,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2018-11-23 13:19:42,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2018-11-23 13:19:42,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:42,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:42,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:19:42,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:19:42,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:19:42,771 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2018-11-23 13:19:42,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:19:42,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:19:42,857 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-23 13:19:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:42,896 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 13:19:42,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:19:42,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-11-23 13:19:42,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:19:42,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 13:19:42,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 13:19:42,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 13:19:42,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2018-11-23 13:19:42,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:19:42,898 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 13:19:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2018-11-23 13:19:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 13:19:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:19:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 13:19:42,900 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 13:19:42,900 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 13:19:42,900 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:19:42,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-11-23 13:19:42,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 13:19:42,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:42,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:42,901 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:42,902 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:42,902 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#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; 257#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; 258#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; 259#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 260#L33-3 assume !(main_~i~0 < main_~n~0); 253#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 252#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 254#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; 262#L15-6 #t~short4 := ~j~0 > 0; 255#L15-1 assume !#t~short4; 256#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 266#L15-7 [2018-11-23 13:19:42,902 INFO L796 eck$LassoCheckResult]: Loop: 266#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 264#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 265#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 271#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; 268#L15-6 #t~short4 := ~j~0 > 0; 270#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; 269#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 266#L15-7 [2018-11-23 13:19:42,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,902 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2018-11-23 13:19:42,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:42,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2018-11-23 13:19:42,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:42,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:42,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:42,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2018-11-23 13:19:42,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:42,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:42,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:42,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:19:43,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:19:43,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:19:43,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:43,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:43,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:19:43,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2018-11-23 13:19:43,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:19:43,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:19:43,458 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-11-23 13:19:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:43,640 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 13:19:43,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:19:43,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 37 transitions. [2018-11-23 13:19:43,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 13:19:43,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 27 transitions. [2018-11-23 13:19:43,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 13:19:43,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-23 13:19:43,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2018-11-23 13:19:43,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:19:43,642 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 13:19:43,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2018-11-23 13:19:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-23 13:19:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:19:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 13:19:43,644 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 13:19:43,644 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 13:19:43,644 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:19:43,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2018-11-23 13:19:43,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 13:19:43,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:43,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:43,645 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:43,645 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:43,645 INFO L794 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 402#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; 397#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; 398#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; 399#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 400#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; 401#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 411#L33-3 assume !(main_~i~0 < main_~n~0); 393#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 392#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 394#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; 403#L15-6 #t~short4 := ~j~0 > 0; 395#L15-1 assume !#t~short4; 396#L15-3 [2018-11-23 13:19:43,645 INFO L796 eck$LassoCheckResult]: Loop: 396#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 407#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 404#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 405#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 408#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; 409#L15-6 #t~short4 := ~j~0 > 0; 413#L15-1 assume !#t~short4; 396#L15-3 [2018-11-23 13:19:43,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:43,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 1 times [2018-11-23 13:19:43,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:43,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:43,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:43,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:43,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:43,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash -497256520, now seen corresponding path program 1 times [2018-11-23 13:19:43,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:43,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:43,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:43,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:43,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:43,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash 451769787, now seen corresponding path program 1 times [2018-11-23 13:19:43,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:43,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:43,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:43,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:19:43,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:19:43,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:19:43,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:43,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:19:43,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:19:43,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-23 13:19:44,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:19:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:19:44,020 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 11 states. [2018-11-23 13:19:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:44,089 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:19:44,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:19:44,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-23 13:19:44,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 13:19:44,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 13:19:44,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 13:19:44,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 13:19:44,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2018-11-23 13:19:44,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:19:44,091 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 13:19:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2018-11-23 13:19:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-11-23 13:19:44,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:19:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 13:19:44,092 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 13:19:44,092 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 13:19:44,092 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:19:44,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2018-11-23 13:19:44,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-23 13:19:44,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:44,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:44,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:44,093 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:44,093 INFO L794 eck$LassoCheckResult]: Stem: 547#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 542#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; 537#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; 538#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; 539#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 540#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; 541#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 543#L33-3 assume !(main_~i~0 < main_~n~0); 533#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 532#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 534#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; 544#L15-6 #t~short4 := ~j~0 > 0; 535#L15-1 assume !#t~short4; 536#L15-3 [2018-11-23 13:19:44,093 INFO L796 eck$LassoCheckResult]: Loop: 536#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 548#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 545#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 546#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 555#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; 554#L15-6 #t~short4 := ~j~0 > 0; 552#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; 551#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; 549#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 550#L15-6 #t~short4 := ~j~0 > 0; 553#L15-1 assume !#t~short4; 536#L15-3 [2018-11-23 13:19:44,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:44,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1905356638, now seen corresponding path program 2 times [2018-11-23 13:19:44,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:44,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:44,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:44,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:44,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:44,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash -346675363, now seen corresponding path program 1 times [2018-11-23 13:19:44,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:44,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:44,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:44,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:44,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1466067936, now seen corresponding path program 1 times [2018-11-23 13:19:44,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:44,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:44,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:44,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:44,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:44,777 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:19:44,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:19:44,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:19:44,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:19:44,777 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:19:44,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:19:44,777 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:19:44,777 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:19:44,777 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration7_Lasso [2018-11-23 13:19:44,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:19:44,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:19:44,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:44,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,064 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-11-23 13:19:45,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,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-11-23 13:19:45,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,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-11-23 13:19:45,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-11-23 13:19:45,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:45,368 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:19:45,368 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:19:45,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:45,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:45,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:45,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:45,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:45,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:45,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:45,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:45,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:45,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:45,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:45,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:45,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:45,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:45,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:45,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:45,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:45,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:45,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:45,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:45,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:45,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:45,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:45,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:45,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:45,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:45,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:45,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:45,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:45,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:45,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:45,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,396 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:19:45,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,400 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:19:45,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:45,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:45,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:45,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:45,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:45,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:45,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:45,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:45,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:45,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:45,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:45,431 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:19:45,442 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:19:45,442 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:19:45,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:19:45,443 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:19:45,443 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:19:45,443 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(insertionSort_~size, insertionSort_~i) = 1*insertionSort_~size - 4*insertionSort_~i Supporting invariants [] [2018-11-23 13:19:45,474 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-23 13:19:45,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:45,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:45,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:45,603 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-11-23 13:19:45,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-23 13:19:45,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 104 states and 126 transitions. Complement of second has 45 states. [2018-11-23 13:19:45,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-23 13:19:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:19:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-23 13:19:45,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 37 transitions. Stem has 13 letters. Loop has 11 letters. [2018-11-23 13:19:45,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:45,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 37 transitions. Stem has 24 letters. Loop has 11 letters. [2018-11-23 13:19:45,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:45,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 37 transitions. Stem has 13 letters. Loop has 22 letters. [2018-11-23 13:19:45,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:45,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 126 transitions. [2018-11-23 13:19:45,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-23 13:19:45,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 104 states and 126 transitions. [2018-11-23 13:19:45,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-23 13:19:45,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 13:19:45,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 126 transitions. [2018-11-23 13:19:45,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:19:45,902 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 126 transitions. [2018-11-23 13:19:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 126 transitions. [2018-11-23 13:19:45,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 45. [2018-11-23 13:19:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:19:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-11-23 13:19:45,906 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 13:19:45,906 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-11-23 13:19:45,906 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 13:19:45,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 55 transitions. [2018-11-23 13:19:45,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 13:19:45,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:45,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:45,908 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:45,908 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:45,908 INFO L794 eck$LassoCheckResult]: Stem: 855#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 850#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; 843#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; 844#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; 847#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 848#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; 849#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 864#L33-3 assume !(main_~i~0 < main_~n~0); 845#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 846#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 873#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; 874#L15-6 #t~short4 := ~j~0 > 0; 869#L15-1 assume !#t~short4; 870#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 856#L15-7 [2018-11-23 13:19:45,908 INFO L796 eck$LassoCheckResult]: Loop: 856#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 834#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 833#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 835#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; 851#L15-6 #t~short4 := ~j~0 > 0; 852#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; 875#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 856#L15-7 [2018-11-23 13:19:45,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2018-11-23 13:19:45,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:45,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:45,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:45,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:45,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:45,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2018-11-23 13:19:45,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:45,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:45,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:45,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:45,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:45,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2018-11-23 13:19:45,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:45,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:46,532 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2018-11-23 13:19:46,568 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:19:46,568 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:19:46,568 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:19:46,568 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:19:46,568 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:19:46,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:19:46,569 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:19:46,569 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:19:46,569 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-11-23 13:19:46,569 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:19:46,569 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:19:46,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,844 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-23 13:19:46,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:46,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:47,158 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:19:47,159 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:19:47,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:47,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:47,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:47,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:47,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:47,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:47,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:47,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:47,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:47,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:47,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:47,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:47,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:47,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:47,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:47,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:47,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:47,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:47,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:47,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:47,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:47,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:47,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,187 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:19:47,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,189 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:19:47,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:47,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:47,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:47,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:47,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:47,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:47,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:47,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:47,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:47,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:47,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:47,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:47,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:47,242 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:19:47,264 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 13:19:47,264 INFO L444 ModelExtractionUtils]: 22 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 13:19:47,264 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:19:47,265 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:19:47,265 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:19:47,265 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_2, insertionSort_~array.offset, insertionSort_~j~0) = 1*v_rep(select #length insertionSort_~array.base)_2 - 1*insertionSort_~array.offset - 4*insertionSort_~j~0 Supporting invariants [] [2018-11-23 13:19:47,296 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-11-23 13:19:47,298 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:19:47,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:47,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:47,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:47,403 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:19:47,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-11-23 13:19:47,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 55 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 81 states and 95 transitions. Complement of second has 16 states. [2018-11-23 13:19:47,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:19:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:19:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-23 13:19:47,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-23 13:19:47,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:47,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 21 letters. Loop has 7 letters. [2018-11-23 13:19:47,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:47,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 14 letters. Loop has 14 letters. [2018-11-23 13:19:47,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:47,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 95 transitions. [2018-11-23 13:19:47,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 13:19:47,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 69 states and 81 transitions. [2018-11-23 13:19:47,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 13:19:47,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 13:19:47,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 81 transitions. [2018-11-23 13:19:47,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:19:47,502 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 81 transitions. [2018-11-23 13:19:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 81 transitions. [2018-11-23 13:19:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2018-11-23 13:19:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:19:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-11-23 13:19:47,504 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-23 13:19:47,504 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-23 13:19:47,505 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 13:19:47,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 76 transitions. [2018-11-23 13:19:47,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 13:19:47,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:47,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:47,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:47,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:47,506 INFO L794 eck$LassoCheckResult]: Stem: 1123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1117#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; 1110#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; 1111#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; 1114#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1115#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; 1116#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1131#L33-3 assume !(main_~i~0 < main_~n~0); 1112#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1113#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1141#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; 1140#L15-6 #t~short4 := ~j~0 > 0; 1137#L15-1 assume !#t~short4; 1136#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1124#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1122#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1148#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1147#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; 1144#L15-6 #t~short4 := ~j~0 > 0; 1142#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; 1126#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; 1127#L15-5 [2018-11-23 13:19:47,506 INFO L796 eck$LassoCheckResult]: Loop: 1127#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1129#L15-6 #t~short4 := ~j~0 > 0; 1160#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; 1156#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1132#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1101#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1100#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1102#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; 1118#L15-6 #t~short4 := ~j~0 > 0; 1106#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; 1107#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; 1127#L15-5 [2018-11-23 13:19:47,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:47,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961465, now seen corresponding path program 1 times [2018-11-23 13:19:47,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:47,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:47,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:47,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:47,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:47,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash -148104591, now seen corresponding path program 1 times [2018-11-23 13:19:47,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:47,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:47,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:47,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:47,547 INFO L82 PathProgramCache]: Analyzing trace with hash -670188039, now seen corresponding path program 2 times [2018-11-23 13:19:47,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:47,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:47,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:47,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:19:47,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:19:47,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:19:47,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:19:47,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:19:47,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:19:47,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:19:47,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:19:47,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-11-23 13:19:47,986 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2018-11-23 13:19:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:19:48,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:19:48,029 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-23 13:19:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:48,156 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2018-11-23 13:19:48,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:19:48,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 110 transitions. [2018-11-23 13:19:48,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 13:19:48,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 91 states and 105 transitions. [2018-11-23 13:19:48,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 13:19:48,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 13:19:48,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 105 transitions. [2018-11-23 13:19:48,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:19:48,160 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-11-23 13:19:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 105 transitions. [2018-11-23 13:19:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-11-23 13:19:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 13:19:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-11-23 13:19:48,167 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-11-23 13:19:48,167 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-11-23 13:19:48,167 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 13:19:48,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 91 transitions. [2018-11-23 13:19:48,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 13:19:48,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:48,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:48,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:48,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:48,169 INFO L794 eck$LassoCheckResult]: Stem: 1416#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1409#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; 1403#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; 1404#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; 1405#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1406#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; 1407#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1408#L33-3 assume !(main_~i~0 < main_~n~0); 1391#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1390#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1392#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; 1439#L15-6 #t~short4 := ~j~0 > 0; 1436#L15-1 assume !#t~short4; 1430#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1431#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1400#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1462#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1461#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; 1460#L15-6 #t~short4 := ~j~0 > 0; 1459#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; 1458#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; 1456#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1455#L15-6 #t~short4 := ~j~0 > 0; 1446#L15-1 assume !#t~short4; 1432#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1421#L15-7 [2018-11-23 13:19:48,169 INFO L796 eck$LassoCheckResult]: Loop: 1421#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1397#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1413#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1422#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; 1410#L15-6 #t~short4 := ~j~0 > 0; 1396#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; 1398#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1421#L15-7 [2018-11-23 13:19:48,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1796534224, now seen corresponding path program 3 times [2018-11-23 13:19:48,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:48,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:48,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:48,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:48,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 5 times [2018-11-23 13:19:48,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:48,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:48,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 9870329, now seen corresponding path program 4 times [2018-11-23 13:19:48,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:48,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:19:48,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:19:48,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_356185b0-d713-4455-b194-776e6ff07e0d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:19:48,284 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:19:48,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:19:48,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:19:48,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:19:48,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:19:48,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2018-11-23 13:19:48,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:19:48,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:19:48,675 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. cyclomatic complexity: 18 Second operand 23 states. [2018-11-23 13:19:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:19:48,844 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2018-11-23 13:19:48,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:19:48,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 136 transitions. [2018-11-23 13:19:48,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 13:19:48,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 81 states and 94 transitions. [2018-11-23 13:19:48,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 13:19:48,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-23 13:19:48,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 94 transitions. [2018-11-23 13:19:48,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:19:48,847 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2018-11-23 13:19:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 94 transitions. [2018-11-23 13:19:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-23 13:19:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:19:48,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2018-11-23 13:19:48,850 INFO L728 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-11-23 13:19:48,850 INFO L608 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-11-23 13:19:48,851 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 13:19:48,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 93 transitions. [2018-11-23 13:19:48,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-23 13:19:48,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:48,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:48,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:48,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:48,853 INFO L794 eck$LassoCheckResult]: Stem: 1755#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1750#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; 1743#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; 1744#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; 1747#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1748#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; 1749#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1777#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; 1765#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 1764#L33-3 assume !(main_~i~0 < main_~n~0); 1745#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 1746#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1775#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; 1774#L15-6 #t~short4 := ~j~0 > 0; 1772#L15-1 assume !#t~short4; 1767#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1768#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1740#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1805#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1803#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; 1801#L15-6 #t~short4 := ~j~0 > 0; 1799#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; 1798#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; 1793#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 1792#L15-6 #t~short4 := ~j~0 > 0; 1773#L15-1 assume !#t~short4; 1770#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1766#L15-7 [2018-11-23 13:19:48,853 INFO L796 eck$LassoCheckResult]: Loop: 1766#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 1731#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 1730#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 1732#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; 1762#L15-6 #t~short4 := ~j~0 > 0; 1790#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; 1776#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 1766#L15-7 [2018-11-23 13:19:48,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash 17685426, now seen corresponding path program 5 times [2018-11-23 13:19:48,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:48,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:48,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:48,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 6 times [2018-11-23 13:19:48,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:48,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:48,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:48,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:48,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1495415351, now seen corresponding path program 6 times [2018-11-23 13:19:48,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:48,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:49,441 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2018-11-23 13:19:49,589 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2018-11-23 13:19:49,863 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-23 13:19:49,905 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:19:49,905 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:19:49,905 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:19:49,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:19:49,905 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:19:49,905 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:19:49,906 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:19:49,906 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:19:49,906 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration11_Lasso [2018-11-23 13:19:49,906 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:19:49,906 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:19:49,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:49,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:49,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:49,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:49,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:49,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:49,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:49,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:49,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:50,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:19:50,449 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:19:50,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:50,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:50,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:50,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:50,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:50,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:50,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:50,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:50,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:50,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:50,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:50,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:50,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:50,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:50,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:50,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:50,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:50,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:50,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:50,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:50,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,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-11-23 13:19:50,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:50,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:50,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:50,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,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-11-23 13:19:50,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:50,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:50,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:50,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,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-11-23 13:19:50,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:50,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:50,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:50,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:50,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:50,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,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-11-23 13:19:50,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:50,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:50,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,482 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:19:50,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,483 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:19:50,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:50,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:50,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:50,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:50,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:50,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:50,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:50,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:50,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:50,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:50,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:50,536 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:19:50,559 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 13:19:50,559 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:19:50,559 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:19:50,560 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:19:50,560 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:19:50,560 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-11-23 13:19:50,592 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 13:19:50,593 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:19:50,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:50,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:50,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:50,690 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 13:19:50,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 80 states and 93 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-23 13:19:50,775 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-11-23 13:19:50,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:19:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:19:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-23 13:19:50,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 7 letters. [2018-11-23 13:19:50,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:50,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 7 letters. [2018-11-23 13:19:50,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:50,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 27 letters. Loop has 14 letters. [2018-11-23 13:19:50,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:50,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 163 transitions. [2018-11-23 13:19:50,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:19:50,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 92 states and 107 transitions. [2018-11-23 13:19:50,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-23 13:19:50,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:19:50,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 107 transitions. [2018-11-23 13:19:50,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:19:50,779 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 107 transitions. [2018-11-23 13:19:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 107 transitions. [2018-11-23 13:19:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-11-23 13:19:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 13:19:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-11-23 13:19:50,782 INFO L728 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-11-23 13:19:50,782 INFO L608 BuchiCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-11-23 13:19:50,782 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 13:19:50,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 100 transitions. [2018-11-23 13:19:50,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:19:50,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:19:50,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:19:50,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:19:50,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:19:50,783 INFO L794 eck$LassoCheckResult]: Stem: 2146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2140#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; 2135#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; 2136#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; 2137#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2138#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; 2139#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2141#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; 2159#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 2158#L33-3 assume !(main_~i~0 < main_~n~0); 2124#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 2123#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2125#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; 2153#L15-6 #t~short4 := ~j~0 > 0; 2160#L15-1 assume !#t~short4; 2149#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2147#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2127#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2126#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 2128#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; 2200#L15-6 #t~short4 := ~j~0 > 0; 2133#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; 2134#L15-3 assume !#t~short4;havoc #t~short4;havoc #t~mem3; 2148#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 2130#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 2145#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; 2203#L15-6 #t~short4 := ~j~0 > 0; 2129#L15-1 [2018-11-23 13:19:50,783 INFO L796 eck$LassoCheckResult]: Loop: 2129#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; 2132#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; 2155#L15-5 #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; 2142#L15-6 #t~short4 := ~j~0 > 0; 2129#L15-1 [2018-11-23 13:19:50,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash 496161610, now seen corresponding path program 3 times [2018-11-23 13:19:50,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:50,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:50,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:50,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:50,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:50,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1239356, now seen corresponding path program 1 times [2018-11-23 13:19:50,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:50,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:19:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:50,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1509363707, now seen corresponding path program 7 times [2018-11-23 13:19:50,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:19:50,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:19:50,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:50,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:19:50,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:19:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:19:51,319 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2018-11-23 13:19:51,625 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2018-11-23 13:19:51,814 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2018-11-23 13:19:52,060 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2018-11-23 13:19:52,109 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:19:52,109 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:19:52,109 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:19:52,109 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:19:52,109 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:19:52,109 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:19:52,109 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:19:52,109 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:19:52,110 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive_true-termination.c.i_Iteration12_Lasso [2018-11-23 13:19:52,110 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:19:52,110 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:19:52,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:19:52,497 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:19:52,497 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:19:52,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:52,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:52,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:52,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:52,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:52,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:52,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:52,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:52,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:52,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:52,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:52,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:52,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:52,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:52,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:52,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:52,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:52,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:52,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:52,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:52,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:52,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:52,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:52,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:52,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:52,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:52,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:52,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:52,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:52,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:52,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:52,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:52,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:52,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:52,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:52,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:52,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:52,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:52,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:52,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:52,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:19:52,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:19:52,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:52,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:52,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:52,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:52,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:52,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:52,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:52,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:52,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:52,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:52,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:52,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:52,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:19:52,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:52,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:19:52,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:52,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:19:52,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:19:52,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:19:52,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:19:52,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:19:52,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:19:52,510 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:19:52,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:19:52,514 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 13:19:52,514 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 13:19:52,562 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:19:52,590 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 13:19:52,590 INFO L444 ModelExtractionUtils]: 48 out of 56 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 13:19:52,590 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:19:52,591 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-23 13:19:52,591 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:19:52,591 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-11-23 13:19:52,611 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-11-23 13:19:52,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:52,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:52,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:52,674 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:19:52,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-23 13:19:52,682 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-11-23 13:19:52,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:19:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:19:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 13:19:52,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-23 13:19:52,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:52,684 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:19:52,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:52,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:52,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:52,765 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:19:52,766 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-23 13:19:52,771 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-11-23 13:19:52,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:19:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:19:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-23 13:19:52,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-23 13:19:52,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:52,772 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:19:52,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:19:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:52,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:19:52,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:19:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:19:52,818 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 13:19:52,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 85 states and 100 transitions. cyclomatic complexity: 21 Second operand 5 states. [2018-11-23 13:19:52,830 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-11-23 13:19:52,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:19:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:19:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-23 13:19:52,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 4 letters. [2018-11-23 13:19:52,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:52,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-23 13:19:52,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:52,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 8 letters. [2018-11-23 13:19:52,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:19:52,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 157 transitions. [2018-11-23 13:19:52,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:19:52,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 0 states and 0 transitions. [2018-11-23 13:19:52,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:19:52,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:19:52,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:19:52,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:19:52,833 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:19:52,833 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:19:52,833 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:19:52,833 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 13:19:52,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:19:52,833 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:19:52,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:19:52,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:19:52 BoogieIcfgContainer [2018-11-23 13:19:52,838 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:19:52,838 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:19:52,838 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:19:52,838 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:19:52,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:19:41" (3/4) ... [2018-11-23 13:19:52,841 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:19:52,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:19:52,841 INFO L168 Benchmark]: Toolchain (without parser) took 12159.31 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 458.8 MB). Free memory was 953.8 MB in the beginning and 1.3 GB in the end (delta: -323.6 MB). Peak memory consumption was 135.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:52,842 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:19:52,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.45 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:52,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:52,843 INFO L168 Benchmark]: Boogie Preprocessor took 22.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:52,843 INFO L168 Benchmark]: RCFGBuilder took 224.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:52,843 INFO L168 Benchmark]: BuchiAutomizer took 11641.84 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.6 MB). Peak memory consumption was 156.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:19:52,844 INFO L168 Benchmark]: Witness Printer took 3.03 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-11-23 13:19:52,846 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.45 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 68.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11641.84 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 335.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -178.6 MB). Peak memory consumption was 156.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.03 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 - 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 -4 * i + unknown-#length-unknown[malloc(n * sizeof (int))] + -1 * a and consists of 5 locations. One deterministic module has affine ranking function size + -4 * i and consists of 11 locations. One deterministic module has affine ranking function unknown-#length-unknown[array] + -1 * array + -4 * j and consists of 7 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 11.5s and 13 iterations. TraceHistogramMax:3. Analysis of lassos took 9.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 7. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 97 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: 181 SDtfs, 263 SDslu, 409 SDs, 0 SdLazy, 741 SolverSat, 115 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: 81ms 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...