./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.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 af6d3df1a288680024c52d2d61adb02fdd276fce ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:50:29,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:50:29,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:50:29,930 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:50:29,930 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:50:29,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:50:29,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:50:29,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:50:29,939 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:50:29,940 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:50:29,941 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:50:29,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:50:29,942 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:50:29,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:50:29,944 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:50:29,945 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:50:29,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:50:29,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:50:29,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:50:29,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:50:29,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:50:29,954 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:50:29,959 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:50:29,959 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:50:29,959 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:50:29,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:50:29,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:50:29,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:50:29,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:50:29,967 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:50:29,967 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:50:29,970 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:50:29,970 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:50:29,970 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:50:29,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:50:29,973 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:50:29,975 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:50:30,010 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:50:30,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:50:30,012 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:50:30,015 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:50:30,016 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:50:30,016 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:50:30,016 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:50:30,016 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:50:30,016 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:50:30,017 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:50:30,017 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:50:30,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:50:30,017 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:50:30,017 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:50:30,017 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:50:30,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:50:30,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:50:30,018 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:50:30,018 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:50:30,018 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:50:30,018 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:50:30,021 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:50:30,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:50:30,022 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:50:30,022 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:50:30,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:50:30,022 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:50:30,022 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:50:30,023 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:50:30,023 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> af6d3df1a288680024c52d2d61adb02fdd276fce [2019-01-01 21:50:30,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:50:30,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:50:30,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:50:30,078 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:50:30,078 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:50:30,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i [2019-01-01 21:50:30,142 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec4bd22d/10a2c76cbe8f49368b8d48914ddbdf07/FLAGc971cf686 [2019-01-01 21:50:30,631 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:50:30,633 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/java_BubbleSort-alloca_true-termination.c.i [2019-01-01 21:50:30,660 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec4bd22d/10a2c76cbe8f49368b8d48914ddbdf07/FLAGc971cf686 [2019-01-01 21:50:30,933 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec4bd22d/10a2c76cbe8f49368b8d48914ddbdf07 [2019-01-01 21:50:30,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:50:30,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:50:30,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:50:30,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:50:30,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:50:30,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:50:30" (1/1) ... [2019-01-01 21:50:30,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518c9a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:30, skipping insertion in model container [2019-01-01 21:50:30,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:50:30" (1/1) ... [2019-01-01 21:50:30,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:50:31,010 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:50:31,394 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:50:31,411 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:50:31,464 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:50:31,530 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:50:31,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31 WrapperNode [2019-01-01 21:50:31,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:50:31,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:50:31,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:50:31,532 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:50:31,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (1/1) ... [2019-01-01 21:50:31,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (1/1) ... [2019-01-01 21:50:31,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:50:31,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:50:31,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:50:31,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:50:31,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (1/1) ... [2019-01-01 21:50:31,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (1/1) ... [2019-01-01 21:50:31,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (1/1) ... [2019-01-01 21:50:31,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (1/1) ... [2019-01-01 21:50:31,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (1/1) ... [2019-01-01 21:50:31,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (1/1) ... [2019-01-01 21:50:31,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (1/1) ... [2019-01-01 21:50:31,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:50:31,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:50:31,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:50:31,689 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:50:31,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (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-01-01 21:50:31,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:50:31,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:50:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:50:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:50:31,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:50:31,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:50:32,105 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:50:32,106 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:50:32,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:50:32 BoogieIcfgContainer [2019-01-01 21:50:32,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:50:32,107 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:50:32,107 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:50:32,112 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:50:32,112 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:50:32,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:50:30" (1/3) ... [2019-01-01 21:50:32,114 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8fa44de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:50:32, skipping insertion in model container [2019-01-01 21:50:32,114 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:50:32,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:50:31" (2/3) ... [2019-01-01 21:50:32,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8fa44de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:50:32, skipping insertion in model container [2019-01-01 21:50:32,115 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:50:32,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:50:32" (3/3) ... [2019-01-01 21:50:32,117 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_BubbleSort-alloca_true-termination.c.i [2019-01-01 21:50:32,178 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:50:32,178 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:50:32,178 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:50:32,179 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:50:32,179 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:50:32,179 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:50:32,179 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:50:32,179 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:50:32,180 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:50:32,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:50:32,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:50:32,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:32,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:32,223 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:50:32,224 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:32,224 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:50:32,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:50:32,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:50:32,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:32,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:32,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:50:32,227 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:32,234 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 5#L558true assume !(main_~array_size~0 < 1); 8#L558-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 6#L550-3true [2019-01-01 21:50:32,235 INFO L796 eck$LassoCheckResult]: Loop: 6#L550-3true assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 3#L551-3true assume !true; 4#L550-2true sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 6#L550-3true [2019-01-01 21:50:32,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:32,241 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-01 21:50:32,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:32,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:32,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:32,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:32,369 INFO L82 PathProgramCache]: Analyzing trace with hash 47218, now seen corresponding path program 1 times [2019-01-01 21:50:32,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:32,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:32,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:50:32,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:50:32,407 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:50:32,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:50:32,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:50:32,426 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-01 21:50:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:50:32,433 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-01 21:50:32,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:50:32,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-01-01 21:50:32,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:50:32,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 12 transitions. [2019-01-01 21:50:32,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 21:50:32,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:50:32,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2019-01-01 21:50:32,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:50:32,445 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-01 21:50:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2019-01-01 21:50:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-01 21:50:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-01 21:50:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-01-01 21:50:32,477 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-01 21:50:32,477 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-01-01 21:50:32,477 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:50:32,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2019-01-01 21:50:32,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:50:32,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:32,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:32,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:50:32,480 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:32,480 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 35#L558 assume !(main_~array_size~0 < 1); 40#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 39#L550-3 [2019-01-01 21:50:32,480 INFO L796 eck$LassoCheckResult]: Loop: 39#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 36#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 37#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 39#L550-3 [2019-01-01 21:50:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:32,481 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-01 21:50:32,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:32,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash 46877, now seen corresponding path program 1 times [2019-01-01 21:50:32,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:32,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:32,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:32,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:32,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:50:32,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:50:32,568 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:50:32,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:50:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:50:32,569 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:50:32,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:50:32,633 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-01-01 21:50:32,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:50:32,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-01-01 21:50:32,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:50:32,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:50:32,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:50:32,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:50:32,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 21:50:32,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:50:32,637 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:50:32,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 21:50:32,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 21:50:32,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:50:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:50:32,642 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:50:32,642 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:50:32,642 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:50:32,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:50:32,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 21:50:32,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:32,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:32,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:50:32,646 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 21:50:32,647 INFO L794 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 59#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 60#L558 assume !(main_~array_size~0 < 1); 65#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 64#L550-3 [2019-01-01 21:50:32,647 INFO L796 eck$LassoCheckResult]: Loop: 64#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 61#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 62#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 67#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 68#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 63#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 64#L550-3 [2019-01-01 21:50:32,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 3 times [2019-01-01 21:50:32,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:32,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:32,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1398152922, now seen corresponding path program 1 times [2019-01-01 21:50:32,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:32,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:32,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:32,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:32,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1893874754, now seen corresponding path program 1 times [2019-01-01 21:50:32,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:32,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:32,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:32,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:33,121 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-01 21:50:33,462 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:50:33,549 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:50:33,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:50:33,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:50:33,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:50:33,551 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:50:33,551 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:50:33,551 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:50:33,551 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:50:33,551 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:50:33,551 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:50:33,552 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:50:33,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:33,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:33,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:33,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:33,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:33,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:34,049 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-01 21:50:34,380 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 21:50:34,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:34,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:34,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:34,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:34,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:34,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:34,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:34,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:35,031 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:50:35,036 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:50:35,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:35,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:35,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:35,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:35,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:35,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:35,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:35,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:35,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:35,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:35,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:35,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:35,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:35,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:35,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:35,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:35,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:35,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:35,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:35,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:35,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:35,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:35,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:35,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:35,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:35,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:35,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:35,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:35,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:35,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:35,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:35,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:35,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:35,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:35,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:35,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:35,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:35,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:35,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:35,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:35,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:35,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:35,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:35,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:35,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:35,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:35,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:35,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:35,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:35,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:35,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:35,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:35,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:35,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:35,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:35,075 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:50:35,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:35,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:35,080 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:50:35,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:35,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:35,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:35,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:35,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:35,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:35,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:35,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:35,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:35,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:35,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:35,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:35,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:35,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:35,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:35,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:35,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:35,229 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:50:35,304 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:50:35,305 INFO L444 ModelExtractionUtils]: 30 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 21:50:35,308 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:50:35,311 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:50:35,311 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:50:35,313 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-01-01 21:50:35,371 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:50:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:35,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:35,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:50:35,477 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-01-01 21:50:35,478 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2019-01-01 21:50:35,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 4 states. [2019-01-01 21:50:35,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:50:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:50:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-01 21:50:35,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-01 21:50:35,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:35,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-01 21:50:35,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:35,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 4 letters. Loop has 12 letters. [2019-01-01 21:50:35,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:35,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-01-01 21:50:35,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:35,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 21 transitions. [2019-01-01 21:50:35,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:50:35,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:50:35,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2019-01-01 21:50:35,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:50:35,545 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-01-01 21:50:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2019-01-01 21:50:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-01 21:50:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:50:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-01 21:50:35,547 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:50:35,548 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:50:35,548 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:50:35,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-01 21:50:35,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:35,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:35,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:35,550 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:50:35,550 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:35,550 INFO L794 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 151#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 152#L558 assume !(main_~array_size~0 < 1); 159#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 161#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 153#L551-3 [2019-01-01 21:50:35,550 INFO L796 eck$LassoCheckResult]: Loop: 153#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 154#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 162#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 153#L551-3 [2019-01-01 21:50:35,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:35,551 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-01 21:50:35,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:35,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:35,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:35,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:35,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:35,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:35,567 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 1 times [2019-01-01 21:50:35,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:35,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:35,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:35,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:35,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash 176800017, now seen corresponding path program 1 times [2019-01-01 21:50:35,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:35,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:35,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:35,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:35,933 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-01 21:50:36,099 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 21:50:36,284 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-01-01 21:50:36,345 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:50:36,345 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:50:36,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:50:36,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:50:36,346 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:50:36,346 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:50:36,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:50:36,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:50:36,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:50:36,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:50:36,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:50:36,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,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-01-01 21:50:36,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:36,590 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-01 21:50:36,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:37,086 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 21:50:37,175 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:50:37,175 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:50:37,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:37,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:37,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:37,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:37,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:37,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:37,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:37,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:37,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:37,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:37,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:37,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:37,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:37,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:37,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:37,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:37,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:37,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:37,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:37,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:37,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:37,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:37,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:37,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:37,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:37,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:37,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:37,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:37,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:37,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:37,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:37,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:37,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:37,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:37,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:37,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:37,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:37,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,268 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:50:37,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,270 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:50:37,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:37,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:37,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:37,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:37,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:37,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:37,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:37,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:37,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:37,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:37,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:37,315 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:50:37,327 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:50:37,327 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:50:37,328 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:50:37,329 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:50:37,330 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:50:37,330 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sort_~i~0, ULTIMATE.start_sort_~pass~0, ULTIMATE.start_sort_~n) = -1*ULTIMATE.start_sort_~i~0 - 1*ULTIMATE.start_sort_~pass~0 + 1*ULTIMATE.start_sort_~n Supporting invariants [] [2019-01-01 21:50:37,435 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:50:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:37,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:37,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:37,666 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-01-01 21:50:37,666 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 21:50:37,794 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2019-01-01 21:50:37,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:50:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:50:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:50:37,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:50:37,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:37,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 21:50:37,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:37,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-01 21:50:37,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:37,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-01-01 21:50:37,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:37,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 20 states and 28 transitions. [2019-01-01 21:50:37,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:50:37,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:50:37,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2019-01-01 21:50:37,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:50:37,802 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-01-01 21:50:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2019-01-01 21:50:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-01 21:50:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:50:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-01-01 21:50:37,805 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-01 21:50:37,805 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-01 21:50:37,805 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:50:37,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-01-01 21:50:37,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:37,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:37,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:37,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:50:37,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:37,807 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 266#L558 assume !(main_~array_size~0 < 1); 267#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 268#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 261#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 262#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 271#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 272#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 263#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 264#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 259#L551-3 [2019-01-01 21:50:37,807 INFO L796 eck$LassoCheckResult]: Loop: 259#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 260#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 270#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 259#L551-3 [2019-01-01 21:50:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:37,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1421271829, now seen corresponding path program 1 times [2019-01-01 21:50:37,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:37,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:37,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:37,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:37,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:38,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:50:38,139 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:50:38,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:38,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:50:38,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 21:50:38,272 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:50:38,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 2 times [2019-01-01 21:50:38,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:38,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:38,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:38,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:38,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:38,491 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-01 21:50:38,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 21:50:38,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 21:50:38,517 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-01-01 21:50:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:50:38,582 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-01-01 21:50:38,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:50:38,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-01-01 21:50:38,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:38,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 34 transitions. [2019-01-01 21:50:38,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 21:50:38,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 21:50:38,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-01-01 21:50:38,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:50:38,590 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-01 21:50:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-01-01 21:50:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-01-01 21:50:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-01 21:50:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-01 21:50:38,593 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-01 21:50:38,593 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-01 21:50:38,593 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:50:38,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-01 21:50:38,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:50:38,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:38,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:38,595 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 21:50:38,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:38,595 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 351#L558 assume !(main_~array_size~0 < 1); 352#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 353#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 346#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 347#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 356#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 357#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 359#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 360#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 358#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 348#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 349#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 344#L551-3 [2019-01-01 21:50:38,595 INFO L796 eck$LassoCheckResult]: Loop: 344#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 345#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 355#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 344#L551-3 [2019-01-01 21:50:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1373641048, now seen corresponding path program 2 times [2019-01-01 21:50:38,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:38,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:38,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:38,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:38,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:38,616 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 3 times [2019-01-01 21:50:38,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:38,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:38,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:38,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:38,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:38,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:38,632 INFO L82 PathProgramCache]: Analyzing trace with hash -307910395, now seen corresponding path program 1 times [2019-01-01 21:50:38,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:38,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:38,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:38,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:38,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:39,551 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-01-01 21:50:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:39,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:50:39,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:50:39,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:39,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:40,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2019-01-01 21:50:40,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:50:40,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-01 21:50:40,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:50:40,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:50:40,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:50:40,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-01-01 21:50:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:50:40,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:50:40,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2019-01-01 21:50:40,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 21:50:40,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-01-01 21:50:40,305 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 18 states. [2019-01-01 21:50:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:50:41,003 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2019-01-01 21:50:41,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-01 21:50:41,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-01-01 21:50:41,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 21:50:41,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 79 transitions. [2019-01-01 21:50:41,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-01-01 21:50:41,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-01-01 21:50:41,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 79 transitions. [2019-01-01 21:50:41,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:50:41,009 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 79 transitions. [2019-01-01 21:50:41,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 79 transitions. [2019-01-01 21:50:41,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2019-01-01 21:50:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 21:50:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2019-01-01 21:50:41,016 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-01-01 21:50:41,016 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2019-01-01 21:50:41,016 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:50:41,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2019-01-01 21:50:41,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 21:50:41,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:50:41,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:50:41,022 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:50:41,022 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:50:41,023 INFO L794 eck$LassoCheckResult]: Stem: 521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 512#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 513#L558 assume !(main_~array_size~0 < 1); 520#L558-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;sort_#in~x.base, sort_#in~x.offset, sort_#in~n := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc sort_#t~mem4, sort_#t~mem5, sort_#t~mem6, sort_#t~mem7, sort_~temp~0, sort_#t~post3, sort_#t~post2, sort_~x.base, sort_~x.offset, sort_~n, sort_~pass~0, sort_~i~0;sort_~x.base, sort_~x.offset := sort_#in~x.base, sort_#in~x.offset;sort_~n := sort_#in~n;havoc sort_~pass~0;havoc sort_~i~0;sort_~pass~0 := 1; 522#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 523#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 539#L552 assume !(sort_#t~mem4 > sort_#t~mem5);havoc sort_#t~mem4;havoc sort_#t~mem5; 528#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 529#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 533#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 534#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 547#L551-3 assume !(sort_~i~0 < sort_~n - sort_~pass~0); 545#L550-2 sort_#t~post2 := sort_~pass~0;sort_~pass~0 := 1 + sort_#t~post2;havoc sort_#t~post2; 542#L550-3 assume !!(sort_~pass~0 < sort_~n);sort_~i~0 := 0; 514#L551-3 [2019-01-01 21:50:41,023 INFO L796 eck$LassoCheckResult]: Loop: 514#L551-3 assume !!(sort_~i~0 < sort_~n - sort_~pass~0);call sort_#t~mem4 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);call sort_#t~mem5 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 515#L552 assume sort_#t~mem4 > sort_#t~mem5;havoc sort_#t~mem4;havoc sort_#t~mem5;call sort_#t~mem6 := read~int(sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);sort_~temp~0 := sort_#t~mem6;havoc sort_#t~mem6;call sort_#t~mem7 := read~int(sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4);call write~int(sort_#t~mem7, sort_~x.base, sort_~x.offset + 4 * sort_~i~0, 4);havoc sort_#t~mem7;call write~int(sort_~temp~0, sort_~x.base, sort_~x.offset + 4 * (1 + sort_~i~0), 4); 526#L551-2 sort_#t~post3 := sort_~i~0;sort_~i~0 := 1 + sort_#t~post3;havoc sort_#t~post3; 514#L551-3 [2019-01-01 21:50:41,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:41,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1371794006, now seen corresponding path program 2 times [2019-01-01 21:50:41,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:41,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:41,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:41,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:50:41,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash 54716, now seen corresponding path program 4 times [2019-01-01 21:50:41,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:41,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:41,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 501436231, now seen corresponding path program 3 times [2019-01-01 21:50:41,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:50:41,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:50:41,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:41,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:50:41,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:50:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:50:41,625 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-01 21:50:41,833 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 21:50:42,453 WARN L181 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-01-01 21:50:42,545 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:50:42,545 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:50:42,545 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:50:42,546 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:50:42,546 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:50:42,546 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:50:42,546 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:50:42,546 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:50:42,547 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_BubbleSort-alloca_true-termination.c.i_Iteration7_Lasso [2019-01-01 21:50:42,547 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:50:42,547 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:50:42,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,815 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-01-01 21:50:42,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:42,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:50:43,585 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:50:43,586 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:50:43,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:43,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:43,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:43,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:43,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:43,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:43,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:43,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:43,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:43,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:43,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:43,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:43,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:43,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:43,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:43,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:43,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:43,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:43,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:43,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:43,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:43,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:43,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:43,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:43,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:43,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:43,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:43,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:43,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:43,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:43,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:43,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:43,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:43,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:43,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:43,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:43,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:50:43,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:43,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:43,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:43,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:50:43,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:50:43,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:43,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:43,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:43,624 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:50:43,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:43,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:43,627 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:50:43,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:43,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:43,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:43,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:43,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:43,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:43,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:43,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:43,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:43,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:43,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:43,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:43,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:43,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:43,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:43,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:43,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:43,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:50:43,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:50:43,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:50:43,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:50:43,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:50:43,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:50:43,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:50:43,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:50:43,676 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:50:43,695 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:50:43,696 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 21:50:43,696 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:50:43,698 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:50:43,699 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:50:43,699 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sort_~x.base)_3, ULTIMATE.start_sort_~x.offset, ULTIMATE.start_sort_~i~0) = 1*v_rep(select #length ULTIMATE.start_sort_~x.base)_3 - 1*ULTIMATE.start_sort_~x.offset - 4*ULTIMATE.start_sort_~i~0 Supporting invariants [] [2019-01-01 21:50:43,783 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-01-01 21:50:43,786 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:50:43,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:43,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:43,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:43,838 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-01-01 21:50:43,838 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-01-01 21:50:43,859 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2019-01-01 21:50:43,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:50:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:50:43,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:50:43,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 21:50:43,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:43,863 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:50:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:43,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:43,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:43,932 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:50:43,932 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-01-01 21:50:43,963 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 74 states and 102 transitions. Complement of second has 7 states. [2019-01-01 21:50:43,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:50:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:50:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:50:43,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 21:50:43,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:43,968 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:50:43,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:50:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:44,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:50:44,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:50:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:50:44,018 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:50:44,018 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2019-01-01 21:50:44,039 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 67 states and 92 transitions. Complement of second has 6 states. [2019-01-01 21:50:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:50:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:50:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-01 21:50:44,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 21:50:44,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:44,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-01 21:50:44,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:44,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-01 21:50:44,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:50:44,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 92 transitions. [2019-01-01 21:50:44,045 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:50:44,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 0 states and 0 transitions. [2019-01-01 21:50:44,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:50:44,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:50:44,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:50:44,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:50:44,045 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:50:44,045 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:50:44,045 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:50:44,046 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:50:44,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:50:44,048 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:50:44,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:50:44,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:50:44 BoogieIcfgContainer [2019-01-01 21:50:44,055 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:50:44,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:50:44,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:50:44,056 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:50:44,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:50:32" (3/4) ... [2019-01-01 21:50:44,060 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:50:44,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:50:44,061 INFO L168 Benchmark]: Toolchain (without parser) took 13123.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -231.4 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:50:44,063 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:50:44,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.27 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:50:44,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:50:44,067 INFO L168 Benchmark]: Boogie Preprocessor took 29.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:50:44,067 INFO L168 Benchmark]: RCFGBuilder took 420.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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:50:44,068 INFO L168 Benchmark]: BuchiAutomizer took 11948.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.7 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:50:44,069 INFO L168 Benchmark]: Witness Printer took 4.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:50:44,076 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 591.27 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 124.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 420.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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11948.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -71.7 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * pass + n and consists of 3 locations. One deterministic module has affine ranking function -1 * i + -1 * pass + n and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[x] + -1 * x + -4 * i and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.8s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 10.0s. Construction of modules took 0.5s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 88 SDtfs, 96 SDslu, 79 SDs, 0 SdLazy, 221 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital186 mio100 ax110 hnf99 lsp87 ukn66 mio100 lsp59 div100 bol100 ite100 ukn100 eq180 hnf88 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...