./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loops/bubble_sort_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/loops/bubble_sort_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash b59596f519f075436dc724f37897dcc3b0f74afa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:39:38,118 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:39:38,120 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:39:38,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:39:38,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:39:38,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:39:38,142 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:39:38,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:39:38,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:39:38,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:39:38,155 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:39:38,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:39:38,156 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:39:38,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:39:38,161 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:39:38,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:39:38,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:39:38,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:39:38,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:39:38,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:39:38,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:39:38,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:39:38,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:39:38,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:39:38,194 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:39:38,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:39:38,196 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:39:38,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:39:38,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:39:38,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:39:38,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:39:38,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:39:38,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:39:38,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:39:38,205 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:39:38,206 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:39:38,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:39:38,231 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:39:38,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:39:38,233 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:39:38,233 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:39:38,233 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:39:38,233 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:39:38,234 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:39:38,234 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:39:38,234 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:39:38,234 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:39:38,234 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:39:38,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:39:38,235 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:39:38,235 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:39:38,235 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:39:38,235 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:39:38,235 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:39:38,235 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:39:38,236 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:39:38,236 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:39:38,236 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:39:38,236 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:39:38,236 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:39:38,236 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:39:38,237 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:39:38,237 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:39:38,237 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:39:38,237 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:39:38,237 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:39:38,238 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:39:38,238 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:39:38,239 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:39:38,239 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b59596f519f075436dc724f37897dcc3b0f74afa [2019-01-14 03:39:38,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:39:38,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:39:38,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:39:38,313 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:39:38,314 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:39:38,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/bubble_sort_true-unreach-call_true-termination.i [2019-01-14 03:39:38,373 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbb9ebbb/354871b003d842e5ba53ebb4866eb44e/FLAG261b2292f [2019-01-14 03:39:38,867 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:39:38,868 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/bubble_sort_true-unreach-call_true-termination.i [2019-01-14 03:39:38,875 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbb9ebbb/354871b003d842e5ba53ebb4866eb44e/FLAG261b2292f [2019-01-14 03:39:39,226 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbb9ebbb/354871b003d842e5ba53ebb4866eb44e [2019-01-14 03:39:39,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:39:39,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:39:39,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:39:39,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:39:39,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:39:39,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398fa6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39, skipping insertion in model container [2019-01-14 03:39:39,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:39:39,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:39:39,452 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:39:39,465 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:39:39,496 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:39:39,513 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:39:39,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39 WrapperNode [2019-01-14 03:39:39,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:39:39,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:39:39,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:39:39,515 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:39:39,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:39:39,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:39:39,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:39:39,564 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:39:39,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (1/1) ... [2019-01-14 03:39:39,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:39:39,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:39:39,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:39:39,656 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:39:39,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (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-14 03:39:39,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 03:39:39,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 03:39:39,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:39:39,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:39:39,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 03:39:39,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 03:39:40,246 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:39:40,247 INFO L286 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-14 03:39:40,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:40 BoogieIcfgContainer [2019-01-14 03:39:40,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:39:40,249 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:39:40,249 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:39:40,253 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:39:40,254 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:40,255 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:39:39" (1/3) ... [2019-01-14 03:39:40,255 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fcb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:39:40, skipping insertion in model container [2019-01-14 03:39:40,256 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:40,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:39:39" (2/3) ... [2019-01-14 03:39:40,256 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fcb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:39:40, skipping insertion in model container [2019-01-14 03:39:40,256 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:39:40,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:39:40" (3/3) ... [2019-01-14 03:39:40,258 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubble_sort_true-unreach-call_true-termination.i [2019-01-14 03:39:40,319 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:39:40,320 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:39:40,320 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:39:40,320 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:39:40,320 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:39:40,320 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:39:40,321 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:39:40,321 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:39:40,321 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:39:40,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-14 03:39:40,358 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2019-01-14 03:39:40,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:40,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:40,366 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:39:40,366 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:39:40,366 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:39:40,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-14 03:39:40,369 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2019-01-14 03:39:40,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:40,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:40,370 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:39:40,370 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:39:40,377 INFO L794 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 23#L55true assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 4#L62true assume q1_#t~switch13;q1_~i~1 := 0; 15#L63-3true [2019-01-14 03:39:40,377 INFO L796 eck$LassoCheckResult]: Loop: 15#L63-3true assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 16#L63-2true q1_#t~pre14 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre14; 15#L63-3true [2019-01-14 03:39:40,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:40,384 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2019-01-14 03:39:40,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:40,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:40,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:40,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:40,516 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-14 03:39:40,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:40,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:39:40,522 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:39:40,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:40,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2019-01-14 03:39:40,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:40,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:40,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:39:40,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:39:40,704 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-01-14 03:39:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:40,803 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-14 03:39:40,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:39:40,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2019-01-14 03:39:40,808 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 03:39:40,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2019-01-14 03:39:40,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 03:39:40,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 03:39:40,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2019-01-14 03:39:40,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:40,815 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-14 03:39:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2019-01-14 03:39:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-14 03:39:40,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 03:39:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-01-14 03:39:40,844 INFO L729 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 03:39:40,844 INFO L609 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 03:39:40,844 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:39:40,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-01-14 03:39:40,845 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-14 03:39:40,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:40,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:40,846 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:39:40,846 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:39:40,846 INFO L794 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 69#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 66#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 67#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 72#L68 assume q1_#t~switch13;q1_~i~1 := 0; 75#L69-3 [2019-01-14 03:39:40,846 INFO L796 eck$LassoCheckResult]: Loop: 75#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 76#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 75#L69-3 [2019-01-14 03:39:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:40,847 INFO L82 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2019-01-14 03:39:40,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:40,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:40,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:40,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:40,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2019-01-14 03:39:40,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:40,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2019-01-14 03:39:40,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:40,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:41,182 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 03:39:41,620 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-01-14 03:39:42,020 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-14 03:39:42,036 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:39:42,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:39:42,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:39:42,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:39:42,038 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:39:42,038 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:39:42,038 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:39:42,038 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:39:42,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-14 03:39:42,039 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:39:42,039 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:39:42,059 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-14 03:39:42,064 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-14 03:39:42,075 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-14 03:39:42,077 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-14 03:39:42,080 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-14 03:39:42,116 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-14 03:39:42,123 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-14 03:39:42,128 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-14 03:39:42,133 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-14 03:39:42,139 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-14 03:39:42,144 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-14 03:39:42,173 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-14 03:39:42,176 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-14 03:39:42,184 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-14 03:39:42,213 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-14 03:39:42,218 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-14 03:39:42,236 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-14 03:39:42,248 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-14 03:39:42,745 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:39:42,750 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:39:42,753 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-14 03:39:42,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,764 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-14 03:39:42,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,771 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-14 03:39:42,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,776 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-14 03:39:42,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,779 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-14 03:39:42,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:42,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:42,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,789 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-14 03:39:42,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,792 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-14 03:39:42,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,796 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-14 03:39:42,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,799 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-14 03:39:42,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:42,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:42,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,807 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-14 03:39:42,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,811 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-14 03:39:42,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:42,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:42,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,831 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-14 03:39:42,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:42,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:42,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,841 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-14 03:39:42,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,853 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-14 03:39:42,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:42,864 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:42,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,881 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-14 03:39:42,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,886 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-14 03:39:42,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:39:42,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:39:42,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:39:42,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,893 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-14 03:39:42,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:42,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:42,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:42,905 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-14 03:39:42,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:42,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:42,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:42,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:42,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:42,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:42,948 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:39:42,998 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:39:42,998 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:39:43,001 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:39:43,007 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:39:43,007 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:39:43,008 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_1, ULTIMATE.start_q1_~#a~1.offset, ULTIMATE.start_q1_~i~1) = 1*v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_1 - 1*ULTIMATE.start_q1_~#a~1.offset - 4*ULTIMATE.start_q1_~i~1 Supporting invariants [] [2019-01-14 03:39:43,013 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:39:43,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:39:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:43,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:43,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:43,159 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-14 03:39:43,162 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-14 03:39:43,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 03:39:43,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2019-01-14 03:39:43,218 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-14 03:39:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:39:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-14 03:39:43,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 03:39:43,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:39:43,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 03:39:43,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:39:43,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 03:39:43,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:39:43,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2019-01-14 03:39:43,226 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-14 03:39:43,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2019-01-14 03:39:43,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 03:39:43,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 03:39:43,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2019-01-14 03:39:43,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:43,228 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-01-14 03:39:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2019-01-14 03:39:43,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2019-01-14 03:39:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 03:39:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-14 03:39:43,231 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 03:39:43,231 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-14 03:39:43,232 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:39:43,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-01-14 03:39:43,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 03:39:43,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:43,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:43,234 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:43,234 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:39:43,234 INFO L794 eck$LassoCheckResult]: Stem: 168#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 166#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 167#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 164#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 165#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 172#L68 assume !q1_#t~switch13; 163#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 159#L17-3 [2019-01-14 03:39:43,234 INFO L796 eck$LassoCheckResult]: Loop: 159#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 160#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 158#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 159#L17-3 [2019-01-14 03:39:43,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2019-01-14 03:39:43,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:43,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:43,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:43,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:43,266 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-14 03:39:43,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:43,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:39:43,267 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:39:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,268 INFO L82 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2019-01-14 03:39:43,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:43,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:43,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:43,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:43,310 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-14 03:39:43,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:43,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:39:43,313 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:39:43,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:39:43,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:39:43,314 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 03:39:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:43,371 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-01-14 03:39:43,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:39:43,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-01-14 03:39:43,373 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:43,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2019-01-14 03:39:43,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 03:39:43,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 03:39:43,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-01-14 03:39:43,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:43,375 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-14 03:39:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-01-14 03:39:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 03:39:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 03:39:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-01-14 03:39:43,378 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-14 03:39:43,378 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-14 03:39:43,378 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:39:43,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-01-14 03:39:43,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:43,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:43,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:43,380 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:43,380 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:39:43,380 INFO L794 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 213#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 214#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 211#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 212#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 219#L68 assume !q1_#t~switch13; 210#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 205#L17-3 [2019-01-14 03:39:43,381 INFO L796 eck$LassoCheckResult]: Loop: 205#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 206#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 207#L22 assume !(bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size); 208#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 209#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 204#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 205#L17-3 [2019-01-14 03:39:43,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2019-01-14 03:39:43,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:43,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:43,453 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-14 03:39:43,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:43,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:39:43,454 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:39:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2019-01-14 03:39:43,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:43,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:43,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:43,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:39:43,510 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:39:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:39:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:39:43,511 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 03:39:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:43,532 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-14 03:39:43,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:39:43,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-14 03:39:43,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:43,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2019-01-14 03:39:43,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 03:39:43,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 03:39:43,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-01-14 03:39:43,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:43,537 INFO L706 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-14 03:39:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-01-14 03:39:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-14 03:39:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 03:39:43,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-01-14 03:39:43,540 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 03:39:43,540 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-14 03:39:43,540 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:39:43,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-01-14 03:39:43,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:43,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:43,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:43,541 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:43,542 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:43,542 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 262#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 259#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 260#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 265#L68 assume !q1_#t~switch13; 258#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 253#L17-3 [2019-01-14 03:39:43,542 INFO L796 eck$LassoCheckResult]: Loop: 253#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 254#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 255#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 264#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 256#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 257#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 252#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 253#L17-3 [2019-01-14 03:39:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2019-01-14 03:39:43,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:43,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:43,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:43,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:43,594 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-14 03:39:43,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:43,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:39:43,595 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:39:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2019-01-14 03:39:43,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:43,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:43,812 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-14 03:39:43,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:39:43,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:39:43,851 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 03:39:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:43,863 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-01-14 03:39:43,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:39:43,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2019-01-14 03:39:43,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:43,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2019-01-14 03:39:43,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 03:39:43,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 03:39:43,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-01-14 03:39:43,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:43,867 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-14 03:39:43,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-01-14 03:39:43,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 03:39:43,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 03:39:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-01-14 03:39:43,870 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-14 03:39:43,870 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-14 03:39:43,870 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:39:43,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-01-14 03:39:43,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:43,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:43,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:43,871 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:43,872 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:39:43,872 INFO L794 eck$LassoCheckResult]: Stem: 309#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 307#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 308#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 305#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 306#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 311#L68 assume q1_#t~switch13;q1_~i~1 := 0; 314#L69-3 assume !(q1_~i~1 < q1_~N~0); 312#L69-4 q1_~i~1 := 0; 313#L70-3 [2019-01-14 03:39:43,872 INFO L796 eck$LassoCheckResult]: Loop: 313#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 317#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 313#L70-3 [2019-01-14 03:39:43,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,873 INFO L82 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2019-01-14 03:39:43,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:43,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:43,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:43,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2019-01-14 03:39:43,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:43,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:43,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:43,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,896 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:39:43,896 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:39:43,896 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:39:43,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2019-01-14 03:39:43,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:43,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:43,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:43,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:43,999 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:39:44,002 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:39:44,002 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:39:44,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:44,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:44,266 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-14 03:39:44,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:44,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 03:39:44,547 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 03:39:44,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 03:39:44,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 03:39:44,549 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-14 03:39:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:44,943 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-01-14 03:39:44,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:39:44,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-01-14 03:39:44,946 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2019-01-14 03:39:44,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2019-01-14 03:39:44,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-14 03:39:44,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-14 03:39:44,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-01-14 03:39:44,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:44,948 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-01-14 03:39:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-01-14 03:39:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2019-01-14 03:39:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 03:39:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-14 03:39:44,951 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-14 03:39:44,951 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-14 03:39:44,951 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:39:44,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-01-14 03:39:44,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:44,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:44,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:44,953 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:44,953 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:44,953 INFO L794 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 409#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 410#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 407#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 408#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 413#L68 assume q1_#t~switch13;q1_~i~1 := 0; 416#L69-3 assume !(q1_~i~1 < q1_~N~0); 414#L69-4 q1_~i~1 := 0; 415#L70-3 assume !(q1_~i~1 < q1_~N~0); 406#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 401#L17-3 [2019-01-14 03:39:44,954 INFO L796 eck$LassoCheckResult]: Loop: 401#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 402#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 403#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 412#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 404#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 405#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 400#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 401#L17-3 [2019-01-14 03:39:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2019-01-14 03:39:44,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:44,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:44,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:44,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:44,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:44,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2019-01-14 03:39:44,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:44,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:44,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2019-01-14 03:39:44,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:44,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:44,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:39:45,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:39:45,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 03:39:45,706 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-14 03:39:45,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:39:45,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:39:45,749 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-14 03:39:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:45,874 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-01-14 03:39:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 03:39:45,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-01-14 03:39:45,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:45,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 23 states and 27 transitions. [2019-01-14 03:39:45,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 03:39:45,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 03:39:45,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2019-01-14 03:39:45,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:45,879 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-14 03:39:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2019-01-14 03:39:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-01-14 03:39:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 03:39:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-01-14 03:39:45,881 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 03:39:45,881 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 03:39:45,882 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 03:39:45,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-01-14 03:39:45,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:45,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:45,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:45,883 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:45,883 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:39:45,883 INFO L794 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 475#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 476#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 473#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 474#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 479#L68 assume q1_#t~switch13;q1_~i~1 := 0; 482#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 483#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 484#L69-3 assume !(q1_~i~1 < q1_~N~0); 480#L69-4 q1_~i~1 := 0; 481#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 485#L70-2 [2019-01-14 03:39:45,884 INFO L796 eck$LassoCheckResult]: Loop: 485#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 486#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 485#L70-2 [2019-01-14 03:39:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:45,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2019-01-14 03:39:45,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:45,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:45,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:45,890 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:39:45,890 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:39:45,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:39:45,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2019-01-14 03:39:46,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:46,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:46,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:46,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:46,011 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:39:46,011 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:39:46,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:39:46,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:39:46,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 03:39:46,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:39:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:46,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2019-01-14 03:39:46,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:46,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:46,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:46,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:46,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:46,081 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:39:46,081 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:39:46,082 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:39:46,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:39:46,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:39:46,209 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-14 03:39:46,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:39:46,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-01-14 03:39:46,339 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 03:39:46,620 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 03:39:46,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 03:39:46,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 03:39:46,621 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-01-14 03:39:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:39:46,855 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-01-14 03:39:46,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 03:39:46,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2019-01-14 03:39:46,860 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2019-01-14 03:39:46,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2019-01-14 03:39:46,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-01-14 03:39:46,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-14 03:39:46,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2019-01-14 03:39:46,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:39:46,863 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-01-14 03:39:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2019-01-14 03:39:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2019-01-14 03:39:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 03:39:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-01-14 03:39:46,866 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 03:39:46,867 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 03:39:46,867 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 03:39:46,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-01-14 03:39:46,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-14 03:39:46,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:39:46,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:39:46,868 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:39:46,868 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 03:39:46,869 INFO L794 eck$LassoCheckResult]: Stem: 599#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 597#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 598#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 595#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 596#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 601#L68 assume q1_#t~switch13;q1_~i~1 := 0; 604#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 605#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 606#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 607#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 614#L69-3 assume !(q1_~i~1 < q1_~N~0); 613#L69-4 q1_~i~1 := 0; 608#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 609#L70-2 [2019-01-14 03:39:46,869 INFO L796 eck$LassoCheckResult]: Loop: 609#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 610#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 609#L70-2 [2019-01-14 03:39:46,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2019-01-14 03:39:46,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:46,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:46,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:46,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:39:46,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:46,875 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:39:46,875 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:39:46,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:39:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:39:46,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:39:46,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:39:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2019-01-14 03:39:47,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:47,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:47,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:47,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:47,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:47,011 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:39:47,011 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:39:47,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:39:47,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 03:39:47,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-01-14 03:39:47,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:39:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:39:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2019-01-14 03:39:47,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:39:47,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:39:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:47,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:39:47,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:39:47,116 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:39:47,116 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:39:47,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:39:47,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:39:47,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:39:47,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:39:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:39:47,390 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 03:39:48,203 WARN L181 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 130 [2019-01-14 03:39:49,197 WARN L181 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-01-14 03:39:49,200 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:39:49,200 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:39:49,200 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:39:49,200 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:39:49,201 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:39:49,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:39:49,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:39:49,201 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:39:49,201 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-14 03:39:49,201 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:39:49,201 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:39:49,209 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-14 03:39:49,588 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-14 03:39:49,866 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-14 03:39:49,867 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-14 03:39:49,870 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-14 03:39:49,878 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-14 03:39:49,881 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-14 03:39:49,882 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-14 03:39:49,884 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-14 03:39:49,885 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-14 03:39:49,887 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-14 03:39:49,890 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-14 03:39:49,892 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-14 03:39:49,905 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-14 03:39:49,907 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-14 03:39:49,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:39:49,911 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-14 03:39:50,061 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-01-14 03:39:57,632 WARN L181 SmtUtils]: Spent 7.57 s on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-01-14 03:39:57,910 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-14 03:39:59,833 WARN L181 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-01-14 03:39:59,950 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:39:59,951 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:39:59,951 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-14 03:39:59,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:59,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:59,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:59,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:59,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:59,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:59,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:59,958 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-14 03:39:59,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:59,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:39:59,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:39:59,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:59,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:39:59,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:39:59,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:39:59,969 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-14 03:39:59,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:39:59,972 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:39:59,972 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-14 03:39:59,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:39:59,987 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-14 03:39:59,987 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-14 03:40:00,406 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:00,759 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 03:40:00,760 INFO L444 ModelExtractionUtils]: 37 out of 50 variables were initially zero. Simplification set additionally 9 variables to zero. [2019-01-14 03:40:00,761 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:00,763 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2019-01-14 03:40:00,764 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:00,766 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_2, ULTIMATE.start_q1_~#a~1.offset, ULTIMATE.start_q1_~i~1) = 1*v_rep(select #length ULTIMATE.start_q1_~#a~1.base)_2 - 1*ULTIMATE.start_q1_~#a~1.offset - 4*ULTIMATE.start_q1_~i~1 Supporting invariants [] [2019-01-14 03:40:00,824 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-14 03:40:00,838 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 03:40:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:01,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:01,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:01,293 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-14 03:40:01,293 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-14 03:40:01,293 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 03:40:01,607 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 38 states and 48 transitions. Complement of second has 4 states. [2019-01-14 03:40:01,608 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-14 03:40:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-01-14 03:40:01,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-14 03:40:01,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:01,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-14 03:40:01,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:01,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2019-01-14 03:40:01,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:01,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2019-01-14 03:40:01,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 03:40:01,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2019-01-14 03:40:01,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-14 03:40:01,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-14 03:40:01,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-01-14 03:40:01,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:01,616 INFO L706 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-14 03:40:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-01-14 03:40:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-14 03:40:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 03:40:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-01-14 03:40:01,621 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-14 03:40:01,621 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-14 03:40:01,621 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 03:40:01,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-01-14 03:40:01,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 03:40:01,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:01,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:01,622 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:01,622 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:01,626 INFO L794 eck$LassoCheckResult]: Stem: 737#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 735#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 736#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 733#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 734#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 739#L68 assume q1_#t~switch13;q1_~i~1 := 0; 742#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 743#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 753#L69-3 assume !(q1_~i~1 < q1_~N~0); 752#L69-4 q1_~i~1 := 0; 751#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 749#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 750#L70-3 assume !(q1_~i~1 < q1_~N~0); 732#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 727#L17-3 [2019-01-14 03:40:01,626 INFO L796 eck$LassoCheckResult]: Loop: 727#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 728#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 729#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 738#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 730#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 731#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 726#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 727#L17-3 [2019-01-14 03:40:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2019-01-14 03:40:01,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:01,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:01,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:01,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:01,637 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:01,637 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:01,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:01,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:01,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2019-01-14 03:40:01,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:01,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:01,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2019-01-14 03:40:01,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:01,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:01,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:01,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:01,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:01,749 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:01,749 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:01,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:01,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:01,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 03:40:01,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:40:01,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-01-14 03:40:02,105 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-14 03:40:02,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:40:02,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:40:02,135 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-01-14 03:40:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:02,217 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-01-14 03:40:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 03:40:02,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2019-01-14 03:40:02,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 03:40:02,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2019-01-14 03:40:02,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 03:40:02,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 03:40:02,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2019-01-14 03:40:02,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:02,222 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-14 03:40:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2019-01-14 03:40:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-14 03:40:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 03:40:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-01-14 03:40:02,225 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-14 03:40:02,225 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-14 03:40:02,225 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 03:40:02,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2019-01-14 03:40:02,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 03:40:02,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:02,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:02,226 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:02,226 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:02,226 INFO L794 eck$LassoCheckResult]: Stem: 877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 875#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 876#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 873#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 874#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 881#L68 assume q1_#t~switch13;q1_~i~1 := 0; 882#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 883#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 884#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 885#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 890#L69-3 assume !(q1_~i~1 < q1_~N~0); 879#L69-4 q1_~i~1 := 0; 880#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 886#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 887#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 888#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 889#L70-3 assume !(q1_~i~1 < q1_~N~0); 872#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 867#L17-3 [2019-01-14 03:40:02,226 INFO L796 eck$LassoCheckResult]: Loop: 867#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 868#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 869#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 878#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 870#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 871#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 866#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 867#L17-3 [2019-01-14 03:40:02,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:02,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2019-01-14 03:40:02,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:02,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:02,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:02,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,233 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:02,233 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:02,233 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:02,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:40:02,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:40:02,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:40:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:02,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2019-01-14 03:40:02,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:02,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:02,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:02,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2019-01-14 03:40:02,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:02,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:02,399 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:02,401 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:02,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:02,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:40:02,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:40:02,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:40:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:02,995 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-14 03:40:04,705 WARN L181 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 206 DAG size of output: 180 [2019-01-14 03:40:08,621 WARN L181 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 218 DAG size of output: 123 [2019-01-14 03:40:08,623 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:08,624 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:08,624 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:08,624 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:08,624 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:08,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:08,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:08,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:08,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration11_Lasso [2019-01-14 03:40:08,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:08,624 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:08,630 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-14 03:40:08,664 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-14 03:40:08,665 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-14 03:40:08,670 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-14 03:40:08,672 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-14 03:40:08,674 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-14 03:40:08,676 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-14 03:40:08,683 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-14 03:40:08,685 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-14 03:40:08,688 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-14 03:40:08,690 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-14 03:40:08,691 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-14 03:40:08,712 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-14 03:40:08,715 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-14 03:40:09,363 WARN L181 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-01-14 03:40:09,500 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-14 03:40:09,501 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-14 03:40:09,504 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-14 03:40:09,514 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-14 03:40:09,516 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-14 03:40:09,519 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-14 03:40:09,527 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-14 03:40:09,530 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-14 03:40:09,532 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-14 03:40:09,889 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-14 03:40:11,158 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-01-14 03:40:11,275 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:11,275 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:11,276 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-14 03:40:11,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,283 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-14 03:40:11,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,290 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-14 03:40:11,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:11,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:11,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,299 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-14 03:40:11,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,306 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-14 03:40:11,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,308 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-14 03:40:11,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,310 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-14 03:40:11,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:11,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:11,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,322 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-14 03:40:11,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,327 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-14 03:40:11,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,332 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-14 03:40:11,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,337 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-14 03:40:11,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,340 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-14 03:40:11,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:11,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:11,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,349 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-14 03:40:11,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:11,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:11,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:11,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,354 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-14 03:40:11,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:11,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:11,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:11,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,367 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-14 03:40:11,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,368 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:40:11,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,372 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:40:11,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:11,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:11,386 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-14 03:40:11,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:11,388 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:40:11,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:11,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:11,395 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:40:11,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:11,429 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:11,443 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:40:11,444 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 03:40:11,444 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:11,445 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:11,445 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:11,445 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~a~0, ULTIMATE.start_bubblesort_~size) = -1*ULTIMATE.start_bubblesort_~a~0 + 1*ULTIMATE.start_bubblesort_~size Supporting invariants [] [2019-01-14 03:40:11,595 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-01-14 03:40:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:11,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:11,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:11,674 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-14 03:40:11,674 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-14 03:40:11,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 03:40:11,711 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 32 states and 39 transitions. Complement of second has 4 states. [2019-01-14 03:40:11,713 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-14 03:40:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:40:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-01-14 03:40:11,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 7 letters. [2019-01-14 03:40:11,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:11,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 25 letters. Loop has 7 letters. [2019-01-14 03:40:11,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:11,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 14 letters. [2019-01-14 03:40:11,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:11,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-01-14 03:40:11,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:11,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 38 transitions. [2019-01-14 03:40:11,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 03:40:11,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 03:40:11,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-01-14 03:40:11,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:11,718 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-14 03:40:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-01-14 03:40:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-14 03:40:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 03:40:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-01-14 03:40:11,726 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-14 03:40:11,726 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-14 03:40:11,726 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 03:40:11,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2019-01-14 03:40:11,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:11,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:11,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:11,734 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:11,734 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:40:11,734 INFO L794 eck$LassoCheckResult]: Stem: 1089#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1087#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1088#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1085#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1086#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 1092#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1095#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1096#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1097#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1098#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1103#L69-3 assume !(q1_~i~1 < q1_~N~0); 1093#L69-4 q1_~i~1 := 0; 1094#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1102#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1100#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1101#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1099#L70-3 assume !(q1_~i~1 < q1_~N~0); 1083#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1084#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1076#L19-3 [2019-01-14 03:40:11,734 INFO L796 eck$LassoCheckResult]: Loop: 1076#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1077#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1090#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1080#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1076#L19-3 [2019-01-14 03:40:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 810779970, now seen corresponding path program 1 times [2019-01-14 03:40:11,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:11,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:11,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:11,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:11,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:11,750 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:11,750 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:11,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:11,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:11,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 1 times [2019-01-14 03:40:11,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:11,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:11,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:11,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:11,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:11,874 INFO L82 PathProgramCache]: Analyzing trace with hash 618057612, now seen corresponding path program 1 times [2019-01-14 03:40:11,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:11,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:11,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:11,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:11,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:11,881 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:11,882 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:11,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:11,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:12,147 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-14 03:40:13,819 WARN L181 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 210 DAG size of output: 183 [2019-01-14 03:40:19,517 WARN L181 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 221 DAG size of output: 126 [2019-01-14 03:40:19,520 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:40:19,520 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:40:19,520 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:40:19,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:40:19,521 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:40:19,521 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:40:19,521 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:40:19,521 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:40:19,521 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration12_Lasso [2019-01-14 03:40:19,521 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:40:19,521 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:40:19,528 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-14 03:40:19,532 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-14 03:40:19,534 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-14 03:40:19,542 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-14 03:40:19,544 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-14 03:40:19,546 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-14 03:40:19,548 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-14 03:40:19,549 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-14 03:40:19,550 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-14 03:40:19,555 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-14 03:40:19,557 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-14 03:40:20,243 WARN L181 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-01-14 03:40:20,354 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-01-14 03:40:20,354 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-14 03:40:20,357 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-14 03:40:20,358 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-14 03:40:20,367 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-14 03:40:20,375 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-14 03:40:20,378 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-14 03:40:20,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-14 03:40:20,382 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-14 03:40:20,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-14 03:40:20,388 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-14 03:40:20,390 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-14 03:40:20,740 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-01-14 03:40:21,373 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-14 03:40:21,467 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:40:21,467 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:40:21,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:21,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:21,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:21,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:21,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:21,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:21,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:21,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:21,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:21,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:21,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:21,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,478 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-14 03:40:21,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:21,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:21,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:21,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,480 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-14 03:40:21,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:21,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:21,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:21,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:21,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:21,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:21,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,484 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-14 03:40:21,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:21,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:21,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:21,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:21,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:21,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:21,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:21,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,488 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-14 03:40:21,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:21,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:21,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:21,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,490 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-14 03:40:21,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:21,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:21,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,493 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-14 03:40:21,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:21,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:21,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:21,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,496 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-14 03:40:21,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,496 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:40:21,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,498 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:40:21,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:21,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:21,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:40:21,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:40:21,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:40:21,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,505 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-14 03:40:21,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:21,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:21,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 03:40:21,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:40:21,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:40:21,510 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:21,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:40:21,513 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-14 03:40:21,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:40:21,514 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 03:40:21,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:40:21,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:40:21,517 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 03:40:21,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:40:21,540 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:40:21,597 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 03:40:21,597 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-14 03:40:21,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:40:21,599 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 03:40:21,599 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:40:21,599 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_bubblesort_~b~0, ULTIMATE.start_bubblesort_~item.offset) = 4*ULTIMATE.start_bubblesort_~b~0 + 1*ULTIMATE.start_bubblesort_~item.offset Supporting invariants [] [2019-01-14 03:40:21,946 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-01-14 03:40:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:22,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:22,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:22,041 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-14 03:40:22,041 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-14 03:40:22,042 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-14 03:40:22,077 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 50 states and 65 transitions. Complement of second has 7 states. [2019-01-14 03:40:22,080 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-14 03:40:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:40:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-14 03:40:22,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-14 03:40:22,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:22,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 23 letters. Loop has 4 letters. [2019-01-14 03:40:22,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:22,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 8 letters. [2019-01-14 03:40:22,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:40:22,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2019-01-14 03:40:22,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:22,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 37 states and 46 transitions. [2019-01-14 03:40:22,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 03:40:22,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 03:40:22,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2019-01-14 03:40:22,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:22,086 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-01-14 03:40:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2019-01-14 03:40:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-01-14 03:40:22,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 03:40:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-01-14 03:40:22,099 INFO L729 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-01-14 03:40:22,099 INFO L609 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-01-14 03:40:22,100 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 03:40:22,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2019-01-14 03:40:22,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:22,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:22,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:22,106 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:22,106 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:40:22,107 INFO L794 eck$LassoCheckResult]: Stem: 1318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1316#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1317#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1314#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1315#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 1321#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1324#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1325#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1326#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1327#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1332#L69-3 assume !(q1_~i~1 < q1_~N~0); 1322#L69-4 q1_~i~1 := 0; 1323#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1331#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1329#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1330#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1328#L70-3 assume !(q1_~i~1 < q1_~N~0); 1312#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1313#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1307#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1308#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1320#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1310#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1311#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1303#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 1304#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1305#L19-3 [2019-01-14 03:40:22,107 INFO L796 eck$LassoCheckResult]: Loop: 1305#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1306#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1319#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1309#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1305#L19-3 [2019-01-14 03:40:22,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:22,107 INFO L82 PathProgramCache]: Analyzing trace with hash 31459128, now seen corresponding path program 1 times [2019-01-14 03:40:22,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:22,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:22,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:22,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:22,135 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:22,136 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:22,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:22,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:22,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 03:40:22,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:40:22,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-14 03:40:22,427 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:22,428 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 2 times [2019-01-14 03:40:22,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:22,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:22,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:22,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:22,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 03:40:22,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 03:40:22,545 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-14 03:40:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:22,730 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2019-01-14 03:40:22,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 03:40:22,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2019-01-14 03:40:22,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:22,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 37 states and 44 transitions. [2019-01-14 03:40:22,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 03:40:22,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 03:40:22,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2019-01-14 03:40:22,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:22,733 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-01-14 03:40:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2019-01-14 03:40:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-01-14 03:40:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 03:40:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-01-14 03:40:22,736 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-01-14 03:40:22,736 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-01-14 03:40:22,737 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 03:40:22,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2019-01-14 03:40:22,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:22,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:22,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:22,741 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:22,741 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:40:22,741 INFO L794 eck$LassoCheckResult]: Stem: 1498#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1496#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1497#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1494#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1495#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 1501#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1504#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1505#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1516#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1508#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1506#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1507#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1515#L69-3 assume !(q1_~i~1 < q1_~N~0); 1502#L69-4 q1_~i~1 := 0; 1503#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1512#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1513#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1514#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1510#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1511#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1509#L70-3 assume !(q1_~i~1 < q1_~N~0); 1492#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1493#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1487#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1488#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1500#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1490#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1491#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1483#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 1484#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1485#L19-3 [2019-01-14 03:40:22,741 INFO L796 eck$LassoCheckResult]: Loop: 1485#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1486#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1499#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1489#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1485#L19-3 [2019-01-14 03:40:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1103015548, now seen corresponding path program 2 times [2019-01-14 03:40:22,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:22,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:22,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:22,749 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:22,750 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:22,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:22,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:40:22,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:40:22,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:40:22,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 03:40:22,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:40:22,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-01-14 03:40:22,963 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:40:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 3 times [2019-01-14 03:40:22,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:22,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:22,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:22,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:22,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:23,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 03:40:23,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 03:40:23,089 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-01-14 03:40:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:23,294 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-01-14 03:40:23,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 03:40:23,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2019-01-14 03:40:23,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:23,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2019-01-14 03:40:23,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 03:40:23,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 03:40:23,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2019-01-14 03:40:23,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:23,299 INFO L706 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-01-14 03:40:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2019-01-14 03:40:23,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-01-14 03:40:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 03:40:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-01-14 03:40:23,301 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-14 03:40:23,302 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-14 03:40:23,302 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 03:40:23,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-01-14 03:40:23,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:23,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:23,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:23,303 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:23,303 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:40:23,304 INFO L794 eck$LassoCheckResult]: Stem: 1689#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1687#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1688#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1685#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1686#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 1692#L68 assume q1_#t~switch13;q1_~i~1 := 0; 1695#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1696#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1697#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1698#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1700#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 1709#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 1708#L69-3 assume !(q1_~i~1 < q1_~N~0); 1693#L69-4 q1_~i~1 := 0; 1694#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1705#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1706#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1707#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1702#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 1703#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 1701#L70-3 assume !(q1_~i~1 < q1_~N~0); 1683#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 1684#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1704#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1712#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1699#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1682#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1679#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1680#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1691#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 1711#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1710#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 1675#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 1676#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1677#L19-3 [2019-01-14 03:40:23,304 INFO L796 eck$LassoCheckResult]: Loop: 1677#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1678#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1690#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1681#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1677#L19-3 [2019-01-14 03:40:23,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:23,304 INFO L82 PathProgramCache]: Analyzing trace with hash 545700084, now seen corresponding path program 3 times [2019-01-14 03:40:23,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:23,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:23,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:23,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:23,310 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:23,310 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:23,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:23,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 03:40:23,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 03:40:23,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:40:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:23,464 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 4 times [2019-01-14 03:40:23,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:23,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:23,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:23,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:23,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:23,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:23,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1677403586, now seen corresponding path program 1 times [2019-01-14 03:40:23,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:23,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:23,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:23,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:23,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:23,476 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:23,476 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:23,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:23,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:40:23,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:24,088 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 38 treesize of output 30 [2019-01-14 03:40:24,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:40:24,107 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 30 treesize of output 20 [2019-01-14 03:40:24,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:40:24,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:40:24,125 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-14 03:40:24,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:3 [2019-01-14 03:40:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 03:40:24,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:40:24,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-01-14 03:40:24,448 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 03:40:24,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 03:40:24,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-01-14 03:40:24,449 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 11 Second operand 18 states. [2019-01-14 03:40:25,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:25,212 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2019-01-14 03:40:25,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 03:40:25,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 146 transitions. [2019-01-14 03:40:25,218 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-14 03:40:25,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 146 transitions. [2019-01-14 03:40:25,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-01-14 03:40:25,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-01-14 03:40:25,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 146 transitions. [2019-01-14 03:40:25,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:25,220 INFO L706 BuchiCegarLoop]: Abstraction has 118 states and 146 transitions. [2019-01-14 03:40:25,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 146 transitions. [2019-01-14 03:40:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 75. [2019-01-14 03:40:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 03:40:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-01-14 03:40:25,232 INFO L729 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-01-14 03:40:25,232 INFO L609 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-01-14 03:40:25,233 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-14 03:40:25,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 91 transitions. [2019-01-14 03:40:25,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:25,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:25,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:25,240 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:25,240 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:40:25,241 INFO L794 eck$LassoCheckResult]: Stem: 2000#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1998#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 1999#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 1996#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 1997#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 2004#L68 assume q1_#t~switch13;q1_~i~1 := 0; 2007#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2008#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2029#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2030#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2009#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2010#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2027#L69-3 assume !(q1_~i~1 < q1_~N~0); 2028#L69-4 q1_~i~1 := 0; 2025#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2026#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2017#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2018#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2057#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2056#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2055#L70-3 assume !(q1_~i~1 < q1_~N~0); 2054#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 2053#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2052#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2049#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2046#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2047#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2058#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2051#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2012#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2013#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2050#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2048#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 2020#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 1987#L19-3 [2019-01-14 03:40:25,241 INFO L796 eck$LassoCheckResult]: Loop: 1987#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 1988#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2001#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 1991#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 1987#L19-3 [2019-01-14 03:40:25,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash -134358286, now seen corresponding path program 2 times [2019-01-14 03:40:25,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:25,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:25,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:25,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:40:25,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:25,246 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:25,247 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:25,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:25,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 03:40:25,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 03:40:25,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:40:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 5 times [2019-01-14 03:40:25,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:25,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:25,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:25,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:25,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1090597572, now seen corresponding path program 3 times [2019-01-14 03:40:25,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:25,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:25,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:25,411 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:25,412 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:25,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:25,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 03:40:25,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 03:40:25,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 03:40:25,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:40:25,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:40:25,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 85 [2019-01-14 03:40:25,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:40:25,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:40:25,712 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-14 03:40:25,734 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 112 [2019-01-14 03:40:25,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:40:25,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:40:25,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 66 [2019-01-14 03:40:25,860 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 03:40:25,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:40:25,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:40:25,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:40:25,890 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:69, output treesize:23 [2019-01-14 03:40:25,916 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 46 treesize of output 38 [2019-01-14 03:40:25,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:40:25,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 03:40:25,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2019-01-14 03:40:25,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 03:40:25,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:40:25,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 03:40:25,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:5 [2019-01-14 03:40:25,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-14 03:40:25,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 03:40:25,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-14 03:40:26,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 03:40:26,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 03:40:26,067 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. cyclomatic complexity: 22 Second operand 7 states. [2019-01-14 03:40:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:40:26,215 INFO L93 Difference]: Finished difference Result 130 states and 159 transitions. [2019-01-14 03:40:26,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 03:40:26,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 159 transitions. [2019-01-14 03:40:26,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 03:40:26,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 159 transitions. [2019-01-14 03:40:26,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-14 03:40:26,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-14 03:40:26,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 159 transitions. [2019-01-14 03:40:26,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:40:26,224 INFO L706 BuchiCegarLoop]: Abstraction has 130 states and 159 transitions. [2019-01-14 03:40:26,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 159 transitions. [2019-01-14 03:40:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 90. [2019-01-14 03:40:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-14 03:40:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2019-01-14 03:40:26,239 INFO L729 BuchiCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-01-14 03:40:26,239 INFO L609 BuchiCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-01-14 03:40:26,239 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-14 03:40:26,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 111 transitions. [2019-01-14 03:40:26,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:40:26,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:40:26,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:40:26,245 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:40:26,246 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:40:26,248 INFO L794 eck$LassoCheckResult]: Stem: 2333#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2331#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_~argc, main_~#argv.base, main_~#argv.offset;main_~argc := main_#in~argc;main_~#argv.base, main_~#argv.offset := main_#in~argv.base, main_#in~argv.offset;q1_#in~argc, q1_#in~argv.base, q1_#in~argv.offset := main_~argc, main_~#argv.base, main_~#argv.offset;havoc q1_#t~nondet12, q1_#t~switch13, q1_#t~pre14, q1_#t~pre15, q1_#t~pre16, q1_#t~nondet18, q1_#t~mem19, q1_#t~mem20, q1_#t~post17, q1_~r~0, q1_~temp~0, q1_~argc, q1_~argv.base, q1_~argv.offset, q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset, q1_~i~1;q1_~argc := q1_#in~argc;q1_~argv.base, q1_~argv.offset := q1_#in~argv.base, q1_#in~argv.offset; 2332#L55 assume !(q1_~argc < 2);q1_~N~0 := q1_#t~nondet12;havoc q1_#t~nondet12;call q1_~#a~1.base, q1_~#a~1.offset := #Ultimate.allocOnStack(4 * q1_~N~0);havoc q1_~i~1;q1_#t~switch13 := false; 2329#L62 assume !q1_#t~switch13;q1_#t~switch13 := q1_#t~switch13; 2330#L65 assume !q1_#t~switch13;q1_#t~switch13 := true; 2336#L68 assume q1_#t~switch13;q1_~i~1 := 0; 2339#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2340#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2341#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2342#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2360#L69-3 assume !!(q1_~i~1 < q1_~N~0);call write~int(q1_~i~1, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4); 2361#L69-2 q1_#t~pre16 := 1 + q1_~i~1;q1_~i~1 := 1 + q1_~i~1;havoc q1_#t~pre16; 2358#L69-3 assume !(q1_~i~1 < q1_~N~0); 2359#L69-4 q1_~i~1 := 0; 2356#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2357#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2364#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2365#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2348#L70-3 assume !!(q1_~i~1 < q1_~N~0);q1_~r~0 := q1_~i~1 + (if q1_#t~nondet18 < 0 && 0 != q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) then (if q1_~N~0 - q1_~i~1 < 0 then q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) + (q1_~N~0 - q1_~i~1) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1) - (q1_~N~0 - q1_~i~1)) else q1_#t~nondet18 % (q1_~N~0 - q1_~i~1));havoc q1_#t~nondet18;call q1_#t~mem19 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);q1_~temp~0 := q1_#t~mem19;havoc q1_#t~mem19;call q1_#t~mem20 := read~int(q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4);call write~int(q1_#t~mem20, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~i~1, 4);havoc q1_#t~mem20;call write~int(q1_~temp~0, q1_~#a~1.base, q1_~#a~1.offset + 4 * q1_~r~0, 4); 2349#L70-2 q1_#t~post17 := q1_~i~1;q1_~i~1 := 1 + q1_#t~post17;havoc q1_#t~post17; 2346#L70-3 assume !(q1_~i~1 < q1_~N~0); 2347#L60 havoc q1_#t~switch13;bubblesort_#in~size, bubblesort_#in~item.base, bubblesort_#in~item.offset := q1_~N~0, q1_~#a~1.base, q1_~#a~1.offset;havoc bubblesort_#t~mem2, bubblesort_#t~mem3, bubblesort_#t~mem4, bubblesort_#t~mem5, bubblesort_#t~pre1, bubblesort_#t~pre0, bubblesort_~size, bubblesort_~item.base, bubblesort_~item.offset, bubblesort_~a~0, bubblesort_~b~0, bubblesort_~t~0;bubblesort_~size := bubblesort_#in~size;bubblesort_~item.base, bubblesort_~item.offset := bubblesort_#in~item.base, bubblesort_#in~item.offset;havoc bubblesort_~a~0;havoc bubblesort_~b~0;havoc bubblesort_~t~0;bubblesort_~a~0 := 1; 2350#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2351#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2404#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2403#L24 assume !(bubblesort_#t~mem2 > bubblesort_#t~mem3);havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3; 2325#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2326#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2393#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2385#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2384#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2372#L19-3 assume !(bubblesort_~b~0 >= bubblesort_~a~0); 2373#L17-2 bubblesort_#t~pre0 := 1 + bubblesort_~a~0;bubblesort_~a~0 := 1 + bubblesort_~a~0;havoc bubblesort_#t~pre0; 2368#L17-3 assume !!(bubblesort_~a~0 < bubblesort_~size);bubblesort_~b~0 := bubblesort_~size - 1; 2324#L19-3 [2019-01-14 03:40:26,248 INFO L796 eck$LassoCheckResult]: Loop: 2324#L19-3 assume !!(bubblesort_~b~0 >= bubblesort_~a~0); 2367#L22 assume bubblesort_~b~0 - 1 < bubblesort_~size && bubblesort_~b~0 < bubblesort_~size;call bubblesort_#t~mem2 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);call bubblesort_#t~mem3 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2366#L24 assume bubblesort_#t~mem2 > bubblesort_#t~mem3;havoc bubblesort_#t~mem2;havoc bubblesort_#t~mem3;call bubblesort_#t~mem4 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);bubblesort_~t~0 := bubblesort_#t~mem4;havoc bubblesort_#t~mem4;call bubblesort_#t~mem5 := read~int(bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4);call write~int(bubblesort_#t~mem5, bubblesort_~item.base, bubblesort_~item.offset + 4 * (bubblesort_~b~0 - 1), 4);havoc bubblesort_#t~mem5;call write~int(bubblesort_~t~0, bubblesort_~item.base, bubblesort_~item.offset + 4 * bubblesort_~b~0, 4); 2323#L19-2 bubblesort_#t~pre1 := bubblesort_~b~0 - 1;bubblesort_~b~0 := bubblesort_~b~0 - 1;havoc bubblesort_#t~pre1; 2324#L19-3 [2019-01-14 03:40:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash 543853042, now seen corresponding path program 4 times [2019-01-14 03:40:26,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:26,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:26,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:26,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:26,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:26,254 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:26,254 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:26,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:26,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 03:40:26,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 03:40:26,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:40:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:26,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:26,457 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 6 times [2019-01-14 03:40:26,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:26,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:26,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:26,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:40:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1937505340, now seen corresponding path program 5 times [2019-01-14 03:40:26,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:40:26,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:40:26,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:26,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:40:26,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:40:26,483 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 03:40:26,483 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 03:40:26,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 03:40:26,500 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 03:40:26,961 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-14 03:40:26,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 03:40:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:40:36,000 WARN L181 SmtUtils]: Spent 8.82 s on a formula simplification. DAG size of input: 328 DAG size of output: 272 [2019-01-14 03:50:24,003 WARN L181 SmtUtils]: Spent 9.76 m on a formula simplification. DAG size of input: 738 DAG size of output: 185 [2019-01-14 03:50:24,007 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:50:24,008 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:50:24,008 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:50:24,008 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:50:24,008 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:50:24,008 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:24,008 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:50:24,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:50:24,008 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration17_Lasso [2019-01-14 03:50:24,008 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:50:24,008 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:50:24,023 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-14 03:50:24,025 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-14 03:50:24,027 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-14 03:50:24,030 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-14 03:50:24,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:50:24,360 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-01-14 03:50:24,368 INFO L168 Benchmark]: Toolchain (without parser) took 645137.82 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 425.7 MB). Free memory was 948.7 MB in the beginning and 1.4 GB in the end (delta: -406.9 MB). Peak memory consumption was 629.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:50:24,369 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:50:24,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:50:24,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.76 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:50:24,374 INFO L168 Benchmark]: Boogie Preprocessor took 91.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:50:24,375 INFO L168 Benchmark]: RCFGBuilder took 592.54 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-01-14 03:50:24,375 INFO L168 Benchmark]: BuchiAutomizer took 644113.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -248.0 MB). Peak memory consumption was 649.1 MB. Max. memory is 11.5 GB. [2019-01-14 03:50:24,385 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 282.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.76 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 592.54 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 644113.10 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -248.0 MB). Peak memory consumption was 649.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...