./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 647da5540d24322bf98da85423c1800dc68ed16f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:04:14,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:04:14,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:04:14,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:04:14,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:04:14,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:04:14,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:04:14,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:04:14,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:04:14,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:04:14,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:04:14,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:04:14,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:04:14,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:04:14,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:04:14,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:04:14,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:04:14,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:04:14,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:04:14,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:04:14,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:04:14,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:04:14,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:04:14,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:04:14,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:04:14,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:04:14,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:04:14,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:04:14,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:04:14,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:04:14,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:04:14,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:04:14,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:04:14,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:04:14,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:04:14,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:04:14,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:04:14,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:04:14,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:04:14,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:04:14,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:04:14,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:04:14,322 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:04:14,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:04:14,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:04:14,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:04:14,324 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:04:14,325 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:04:14,325 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:04:14,325 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:04:14,325 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:04:14,325 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:04:14,326 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:04:14,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:04:14,326 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:04:14,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:04:14,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:04:14,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:04:14,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:04:14,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:04:14,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:04:14,328 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:04:14,328 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:04:14,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:04:14,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:04:14,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:04:14,329 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:04:14,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:04:14,329 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:04:14,329 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:04:14,330 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:04:14,331 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647da5540d24322bf98da85423c1800dc68ed16f [2019-11-28 03:04:14,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:04:14,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:04:14,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:04:14,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:04:14,686 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:04:14,687 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2019-11-28 03:04:14,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5537908a2/c6904b7d3aa64fc48e50866c64ad14f0/FLAGacd928021 [2019-11-28 03:04:15,267 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:04:15,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/insertionSort_recursive.i [2019-11-28 03:04:15,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5537908a2/c6904b7d3aa64fc48e50866c64ad14f0/FLAGacd928021 [2019-11-28 03:04:15,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5537908a2/c6904b7d3aa64fc48e50866c64ad14f0 [2019-11-28 03:04:15,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:04:15,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:04:15,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:04:15,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:04:15,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:04:15,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:15,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76344466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15, skipping insertion in model container [2019-11-28 03:04:15,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:15,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:04:15,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:04:15,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:04:15,844 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:04:15,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:04:15,876 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:04:15,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15 WrapperNode [2019-11-28 03:04:15,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:04:15,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:04:15,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:04:15,877 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:04:15,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:15,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:15,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:04:15,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:04:15,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:04:15,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:04:15,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:15,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:15,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:15,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:15,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:16,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:16,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... [2019-11-28 03:04:16,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:04:16,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:04:16,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:04:16,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:04:16,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:04:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:04:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure insertionSort [2019-11-28 03:04:16,075 INFO L138 BoogieDeclarations]: Found implementation of procedure insertionSort [2019-11-28 03:04:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:04:16,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:04:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:04:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:04:16,388 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:04:16,389 INFO L297 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 03:04:16,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:16 BoogieIcfgContainer [2019-11-28 03:04:16,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:04:16,391 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:04:16,391 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:04:16,398 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:04:16,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:16,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:04:15" (1/3) ... [2019-11-28 03:04:16,403 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@347d5220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:16, skipping insertion in model container [2019-11-28 03:04:16,403 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:16,403 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:15" (2/3) ... [2019-11-28 03:04:16,404 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@347d5220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:16, skipping insertion in model container [2019-11-28 03:04:16,404 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:16,404 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:16" (3/3) ... [2019-11-28 03:04:16,406 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionSort_recursive.i [2019-11-28 03:04:16,465 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:04:16,466 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:04:16,467 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:04:16,467 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:04:16,467 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:04:16,467 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:04:16,467 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:04:16,467 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:04:16,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 03:04:16,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 03:04:16,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:16,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:16,513 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:04:16,513 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:04:16,513 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:04:16,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-11-28 03:04:16,516 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-28 03:04:16,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:16,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:16,517 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 03:04:16,517 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:04:16,524 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnHeap(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 [2019-11-28 03:04:16,524 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 [2019-11-28 03:04:16,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:16,530 INFO L82 PathProgramCache]: Analyzing trace with hash 60643, now seen corresponding path program 1 times [2019-11-28 03:04:16,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:16,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129992990] [2019-11-28 03:04:16,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:16,666 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:16,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2435, now seen corresponding path program 1 times [2019-11-28 03:04:16,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:16,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783440597] [2019-11-28 03:04:16,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:16,689 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:16,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash 58279397, now seen corresponding path program 1 times [2019-11-28 03:04:16,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:16,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868398043] [2019-11-28 03:04:16,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:16,729 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:16,999 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:04:17,000 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:04:17,001 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:04:17,001 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:04:17,001 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:04:17,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:04:17,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:04:17,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration1_Lasso [2019-11-28 03:04:17,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:04:17,003 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:04:17,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:17,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:17,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:17,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:17,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:17,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:17,479 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:04:17,485 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:17,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:17,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:17,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:17,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:17,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:17,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:17,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:17,511 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:17,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:17,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:17,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:17,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:17,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:17,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:17,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:17,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:17,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:17,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:17,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:17,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:17,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:17,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:17,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:17,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:17,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:17,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:17,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:17,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:17,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:17,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:17,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:17,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:17,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:17,618 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:04:17,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:17,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:17,635 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:04:17,638 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:17,671 INFO L120 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 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:17,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:17,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:17,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:17,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:17,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:17,699 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:17,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:17,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:17,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:17,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:17,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:17,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:17,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:17,749 INFO L120 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 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:17,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:17,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:17,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:17,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:17,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:17,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:17,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:17,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:17,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:17,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:17,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:17,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:17,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:17,819 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:04:17,859 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2019-11-28 03:04:17,859 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:17,869 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:04:17,872 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:04:17,873 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:04:17,874 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*ULTIMATE.start_main_~a~0.offset >= 0] [2019-11-28 03:04:17,895 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-28 03:04:17,911 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:04:17,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:17,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:04:17,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:17,996 WARN L253 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 03:04:17,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:18,040 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 03:04:18,042 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2019-11-28 03:04:18,138 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. [2019-11-28 03:04:18,138 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 [2019-11-28 03:04:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:04:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2019-11-28 03:04:18,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-28 03:04:18,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:18,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-28 03:04:18,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:18,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-28 03:04:18,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:18,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-28 03:04:18,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:18,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-11-28 03:04:18,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:04:18,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:04:18,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-11-28 03:04:18,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:18,165 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 03:04:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-11-28 03:04:18,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 03:04:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:04:18,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-11-28 03:04:18,197 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 03:04:18,197 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-11-28 03:04:18,197 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:04:18,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-11-28 03:04:18,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:18,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:18,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:18,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:04:18,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:04:18,200 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 139#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; 135#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 136#L33-3 assume !(main_~i~0 < main_~n~0); 131#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 129#insertionSortENTRY [2019-11-28 03:04:18,201 INFO L796 eck$LassoCheckResult]: Loop: 129#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 132#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; 140#L15-6 assume !true; 141#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 130#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 129#insertionSortENTRY [2019-11-28 03:04:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 1 times [2019-11-28 03:04:18,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:18,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770075455] [2019-11-28 03:04:18,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:18,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770075455] [2019-11-28 03:04:18,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:04:18,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:04:18,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516257037] [2019-11-28 03:04:18,257 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:04:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:18,257 INFO L82 PathProgramCache]: Analyzing trace with hash 28740467, now seen corresponding path program 1 times [2019-11-28 03:04:18,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:18,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325671141] [2019-11-28 03:04:18,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:18,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325671141] [2019-11-28 03:04:18,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:04:18,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 03:04:18,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511974567] [2019-11-28 03:04:18,272 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:04:18,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:18,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 03:04:18,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 03:04:18,277 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 2 states. [2019-11-28 03:04:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:18,284 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-28 03:04:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 03:04:18,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-28 03:04:18,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:18,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 03:04:18,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:04:18,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:04:18,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-28 03:04:18,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:18,288 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:04:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-28 03:04:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 03:04:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:04:18,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-11-28 03:04:18,291 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:04:18,292 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-28 03:04:18,292 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:04:18,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-11-28 03:04:18,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:18,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:18,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:18,294 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 03:04:18,294 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:18,294 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 175#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; 171#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 172#L33-3 assume !(main_~i~0 < main_~n~0); 167#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 165#insertionSortENTRY [2019-11-28 03:04:18,295 INFO L796 eck$LassoCheckResult]: Loop: 165#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 168#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; 176#L15-6 #t~short4 := ~j~0 > 0; 169#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; 170#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 178#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 166#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 165#insertionSortENTRY [2019-11-28 03:04:18,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:18,295 INFO L82 PathProgramCache]: Analyzing trace with hash 58279346, now seen corresponding path program 2 times [2019-11-28 03:04:18,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:18,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198763371] [2019-11-28 03:04:18,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:18,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198763371] [2019-11-28 03:04:18,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:04:18,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:04:18,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309593293] [2019-11-28 03:04:18,322 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:04:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 1 times [2019-11-28 03:04:18,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:18,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364476768] [2019-11-28 03:04:18,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:18,364 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:18,589 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-11-28 03:04:18,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:04:18,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:04:18,791 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 03:04:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:18,811 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-11-28 03:04:18,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:04:18,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-11-28 03:04:18,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:18,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2019-11-28 03:04:18,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 03:04:18,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 03:04:18,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-28 03:04:18,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:18,821 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 03:04:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-28 03:04:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-11-28 03:04:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:04:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-28 03:04:18,825 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 03:04:18,825 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-28 03:04:18,825 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:04:18,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-28 03:04:18,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:18,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:18,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:18,828 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:18,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:18,828 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 212#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; 208#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 209#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; 210#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 211#L33-3 assume !(main_~i~0 < main_~n~0); 203#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 202#insertionSortENTRY [2019-11-28 03:04:18,829 INFO L796 eck$LassoCheckResult]: Loop: 202#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 205#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; 213#L15-6 #t~short4 := ~j~0 > 0; 206#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; 207#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 215#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 204#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 202#insertionSortENTRY [2019-11-28 03:04:18,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash 171927092, now seen corresponding path program 1 times [2019-11-28 03:04:18,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:18,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255721677] [2019-11-28 03:04:18,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:18,864 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:18,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:18,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1835476522, now seen corresponding path program 2 times [2019-11-28 03:04:18,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:18,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445761728] [2019-11-28 03:04:18,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:18,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:18,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:18,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1744506729, now seen corresponding path program 1 times [2019-11-28 03:04:18,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:18,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028629460] [2019-11-28 03:04:18,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:04:18,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028629460] [2019-11-28 03:04:18,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:04:18,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 03:04:18,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310799438] [2019-11-28 03:04:19,204 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2019-11-28 03:04:19,394 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-28 03:04:19,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:19,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:04:19,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:04:19,433 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-11-28 03:04:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:19,527 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-11-28 03:04:19,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:04:19,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2019-11-28 03:04:19,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:19,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 25 transitions. [2019-11-28 03:04:19,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-28 03:04:19,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 03:04:19,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-11-28 03:04:19,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:19,530 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 03:04:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-11-28 03:04:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-11-28 03:04:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 03:04:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-28 03:04:19,533 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 03:04:19,533 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-28 03:04:19,533 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:04:19,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-28 03:04:19,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:19,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:19,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:19,535 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:19,535 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:19,535 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 265#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; 261#L28 assume !(main_~n~0 < 1);call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;main_~i~0 := 0; 262#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; 263#L33-2 main_#t~post9 := main_~i~0;main_~i~0 := 1 + main_#t~post9;havoc main_#t~post9; 264#L33-3 assume !(main_~i~0 < main_~n~0); 257#L33-4 call insertionSort(0, main_~a~0.base, main_~a~0.offset, main_~n~0);< 256#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 258#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; 266#L15-6 #t~short4 := ~j~0 > 0; 259#L15-1 assume !#t~short4; 260#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 270#L15-7 [2019-11-28 03:04:19,535 INFO L796 eck$LassoCheckResult]: Loop: 270#L15-7 call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~j~0, 4);#t~pre6 := 1 + ~i;~i := 1 + ~i; 268#L19 call insertionSort(#t~pre6, ~array.base, ~array.offset, ~size);< 269#insertionSortENTRY ~i := #in~i;~array.base, ~array.offset := #in~array.base, #in~array.offset;~size := #in~size; 275#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; 272#L15-6 #t~short4 := ~j~0 > 0; 274#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; 273#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 270#L15-7 [2019-11-28 03:04:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash -332541132, now seen corresponding path program 1 times [2019-11-28 03:04:19,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:19,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777067384] [2019-11-28 03:04:19,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:19,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:19,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:19,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 3 times [2019-11-28 03:04:19,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:19,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799056032] [2019-11-28 03:04:19,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:19,589 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash 2143759477, now seen corresponding path program 1 times [2019-11-28 03:04:19,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:19,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563877683] [2019-11-28 03:04:19,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:19,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563877683] [2019-11-28 03:04:19,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013215347] [2019-11-28 03:04:19,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:04:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:19,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 03:04:19,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:19,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:04:19,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-11-28 03:04:19,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403164339] [2019-11-28 03:04:20,344 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-28 03:04:20,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:20,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 03:04:20,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-28 03:04:20,415 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 16 states. [2019-11-28 03:04:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:20,553 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-11-28 03:04:20,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:04:20,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-11-28 03:04:20,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:20,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 23 states and 26 transitions. [2019-11-28 03:04:20,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-11-28 03:04:20,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-28 03:04:20,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2019-11-28 03:04:20,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:20,558 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-28 03:04:20,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2019-11-28 03:04:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-28 03:04:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 03:04:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-28 03:04:20,561 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 03:04:20,561 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 03:04:20,561 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:04:20,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-11-28 03:04:20,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-28 03:04:20,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:20,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:20,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:20,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:20,563 INFO L794 eck$LassoCheckResult]: Stem: 406#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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.allocOnHeap(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; 410#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 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 407#L15-7 [2019-11-28 03:04:20,564 INFO L796 eck$LassoCheckResult]: Loop: 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; 413#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; 412#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; 411#L15-3 assume !#t~short4;havoc #t~mem3;havoc #t~short4; 407#L15-7 [2019-11-28 03:04:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1063486350, now seen corresponding path program 2 times [2019-11-28 03:04:20,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:20,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739301129] [2019-11-28 03:04:20,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:20,594 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:20,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:20,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1094947064, now seen corresponding path program 4 times [2019-11-28 03:04:20,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:20,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656180365] [2019-11-28 03:04:20,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:20,612 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:20,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1119961463, now seen corresponding path program 2 times [2019-11-28 03:04:20,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:20,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577373704] [2019-11-28 03:04:20,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:20,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:21,030 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-28 03:04:21,347 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-11-28 03:04:21,693 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-11-28 03:04:21,774 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:04:21,774 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:04:21,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:04:21,775 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:04:21,775 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:04:21,775 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:21,775 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:04:21,776 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:04:21,776 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionSort_recursive.i_Iteration6_Lasso [2019-11-28 03:04:21,776 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:04:21,776 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:04:21,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:21,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,064 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-11-28 03:04:22,396 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2019-11-28 03:04:22,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:22,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:04:23,089 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:04:23,090 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:23,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:23,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:23,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:23,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:23,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:23,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:23,181 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:23,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:23,222 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:23,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:23,259 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:23,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,283 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:23,284 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:23,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:23,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:23,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:23,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:23,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:23,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:23,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:23,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:23,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:23,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:23,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,349 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:04:23,401 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-28 03:04:23,401 INFO L444 ModelExtractionUtils]: 2 out of 31 variables were initially zero. Simplification set additionally 24 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:23,404 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:04:23,406 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-28 03:04:23,406 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:04:23,406 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length insertionSort_~array.base)_1, insertionSort_~i) = 1*v_rep(select #length insertionSort_~array.base)_1 - 2*insertionSort_~i Supporting invariants [1*v_rep(select #length insertionSort_~array.base)_1 - 2*insertionSort_~size >= 0] [2019-11-28 03:04:23,439 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 03:04:23,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:04:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:23,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 03:04:23,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:23,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 03:04:23,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:23,772 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 5 loop predicates [2019-11-28 03:04:23,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 25 transitions. cyclomatic complexity: 5 Second operand 13 states. [2019-11-28 03:04:30,605 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-11-28 03:04:30,606 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:674) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkCall(IncrementalHoareTripleChecker.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkCall(ProtectiveHoareTripleChecker.java:68) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:78) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiHoareTripleChecker.checkCall(BuchiHoareTripleChecker.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiInterpolantAutomatonBouncer.addNonAcceptingSuccLoop(BuchiInterpolantAutomatonBouncer.java:395) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiInterpolantAutomatonBouncer.computeSuccsLoop(BuchiInterpolantAutomatonBouncer.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiInterpolantAutomatonBouncer.computeSuccs(BuchiInterpolantAutomatonBouncer.java:246) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiInterpolantAutomatonBouncer.computeSuccs(BuchiInterpolantAutomatonBouncer.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.optncsb.NwaToBuchiWrapper.computeSuccessorsCall(NwaToBuchiWrapper.java:120) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.optncsb.StateNWA.getSuccessorsCall(StateNWA.java:69) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.optncsb.automata.BuchiNwa.getSuccessorsCall(BuchiNwa.java:147) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.optncsb.complement.StateNwaNCSB.computeSuccDoubleDeckers_CallOrInternal(StateNwaNCSB.java:107) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.optncsb.complement.StateNwaNCSB.computeSuccCallOrInternal(StateNwaNCSB.java:160) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.optncsb.complement.StateNwaNCSB.getSuccessorsCall(StateNwaNCSB.java:211) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiComplementNCSBSimpleNwa2.callSuccessors(BuchiComplementNCSBSimpleNwa2.java:273) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NwaOutgoingLetterAndTransitionAdapter.callSuccessors(NwaOutgoingLetterAndTransitionAdapter.java:125) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiIntersectNwa.callSuccessors(BuchiIntersectNwa.java:263) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiIntersectNwa.callSuccessors(BuchiIntersectNwa.java:255) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.AbstractBuchiDifference.constructDifferenceFromComplement(AbstractBuchiDifference.java:91) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiDifferenceNCSBLazy3.constructResult(BuchiDifferenceNCSBLazy3.java:84) at de.uni_freiburg.informatik.ultimate.automata.nestedword.buchi.BuchiDifferenceNCSBLazy3.(BuchiDifferenceNCSBLazy3.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.nsbcDifference(RefineBuchi.java:535) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:738) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:551) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 50 more [2019-11-28 03:04:30,612 INFO L168 Benchmark]: Toolchain (without parser) took 15022.35 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.2 MB). Free memory was 955.0 MB in the beginning and 945.4 MB in the end (delta: 9.6 MB). Peak memory consumption was 326.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:30,612 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:04:30,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.18 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:30,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:30,615 INFO L168 Benchmark]: Boogie Preprocessor took 26.88 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:30,615 INFO L168 Benchmark]: RCFGBuilder took 384.98 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:30,616 INFO L168 Benchmark]: BuchiAutomizer took 14217.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 945.4 MB in the end (delta: 166.3 MB). Peak memory consumption was 342.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:30,619 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.18 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 101.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.88 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 384.98 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14217.33 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 176.2 MB). Free memory was 1.1 GB in the beginning and 945.4 MB in the end (delta: 166.3 MB). Peak memory consumption was 342.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...