./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/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-2e94e6a [2019-01-01 22:57:54,773 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:57:54,775 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:57:54,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:57:54,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:57:54,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:57:54,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:57:54,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:57:54,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:57:54,795 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:57:54,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:57:54,797 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:57:54,797 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:57:54,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:57:54,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:57:54,801 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:57:54,802 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:57:54,804 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:57:54,806 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:57:54,808 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:57:54,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:57:54,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:57:54,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:57:54,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:57:54,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:57:54,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:57:54,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:57:54,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:57:54,823 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:57:54,826 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:57:54,827 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:57:54,828 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:57:54,828 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:57:54,830 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:57:54,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:57:54,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:57:54,835 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:57:54,854 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:57:54,854 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:57:54,856 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:57:54,856 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:57:54,856 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:57:54,856 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:57:54,856 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:57:54,857 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:57:54,857 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:57:54,857 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:57:54,858 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:57:54,858 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:57:54,858 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:57:54,858 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:57:54,858 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:57:54,859 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:57:54,859 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:57:54,859 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:57:54,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:57:54,859 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:57:54,859 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:57:54,861 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:57:54,861 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:57:54,861 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:57:54,862 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:57:54,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:57:54,862 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:57:54,862 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:57:54,863 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:57:54,863 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:57:54,863 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:57:54,864 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:57:54,864 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-01 22:57:54,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:57:54,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:57:54,934 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:57:54,936 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:57:54,936 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:57:54,937 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/bubble_sort_true-unreach-call_true-termination.i [2019-01-01 22:57:55,003 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ddfde87/713ebc6028fd465ebf85b5e973e4e794/FLAGbbe454839 [2019-01-01 22:57:55,416 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:57:55,416 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/bubble_sort_true-unreach-call_true-termination.i [2019-01-01 22:57:55,424 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ddfde87/713ebc6028fd465ebf85b5e973e4e794/FLAGbbe454839 [2019-01-01 22:57:55,779 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21ddfde87/713ebc6028fd465ebf85b5e973e4e794 [2019-01-01 22:57:55,786 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:57:55,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:57:55,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:57:55,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:57:55,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:57:55,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:57:55" (1/1) ... [2019-01-01 22:57:55,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649944d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:55, skipping insertion in model container [2019-01-01 22:57:55,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:57:55" (1/1) ... [2019-01-01 22:57:55,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:57:55,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:57:56,073 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:57:56,089 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:57:56,122 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:57:56,144 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:57:56,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56 WrapperNode [2019-01-01 22:57:56,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:57:56,145 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:57:56,145 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:57:56,146 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:57:56,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... [2019-01-01 22:57:56,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... [2019-01-01 22:57:56,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:57:56,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:57:56,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:57:56,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:57:56,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... [2019-01-01 22:57:56,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... [2019-01-01 22:57:56,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... [2019-01-01 22:57:56,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... [2019-01-01 22:57:56,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... [2019-01-01 22:57:56,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... [2019-01-01 22:57:56,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... [2019-01-01 22:57:56,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:57:56,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:57:56,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:57:56,353 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:57:56,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:57:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:57:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:57:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:57:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:57:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:57:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:57:57,058 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:57:57,059 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-01 22:57:57,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:57 BoogieIcfgContainer [2019-01-01 22:57:57,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:57:57,060 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:57:57,061 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:57:57,065 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:57:57,066 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:57,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:57:55" (1/3) ... [2019-01-01 22:57:57,068 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@444bf2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:57:57, skipping insertion in model container [2019-01-01 22:57:57,068 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:57,068 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:57:56" (2/3) ... [2019-01-01 22:57:57,070 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@444bf2c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:57:57, skipping insertion in model container [2019-01-01 22:57:57,070 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:57:57,070 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:57:57" (3/3) ... [2019-01-01 22:57:57,075 INFO L375 chiAutomizerObserver]: Analyzing ICFG bubble_sort_true-unreach-call_true-termination.i [2019-01-01 22:57:57,138 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:57:57,139 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:57:57,139 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:57:57,139 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:57:57,140 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:57:57,140 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:57:57,140 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:57:57,140 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:57:57,140 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:57:57,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-01 22:57:57,183 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2019-01-01 22:57:57,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:57,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:57,192 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 22:57:57,192 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:57:57,192 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:57:57,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-01-01 22:57:57,196 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2019-01-01 22:57:57,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:57,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:57,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 22:57:57,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:57:57,205 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-01 22:57:57,206 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-01 22:57:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:57,214 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2019-01-01 22:57:57,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:57,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:57,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:57:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:57:57,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:57:57,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:57:57,398 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:57:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:57,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2019-01-01 22:57:57,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:57,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:57,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:57,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:57,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:57:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:57:57,602 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2019-01-01 22:57:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:57:57,670 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-01 22:57:57,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:57:57,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2019-01-01 22:57:57,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-01 22:57:57,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2019-01-01 22:57:57,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-01 22:57:57,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 22:57:57,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2019-01-01 22:57:57,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:57:57,683 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-01-01 22:57:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2019-01-01 22:57:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-01 22:57:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 22:57:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2019-01-01 22:57:57,711 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 22:57:57,711 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-01 22:57:57,711 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:57:57,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2019-01-01 22:57:57,712 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-01-01 22:57:57,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:57:57,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:57:57,713 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:57:57,713 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:57:57,714 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-01 22:57:57,714 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-01 22:57:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2019-01-01 22:57:57,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:57,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:57,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:57,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:57,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2019-01-01 22:57:57,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:57,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:57,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:57:57,758 INFO L82 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2019-01-01 22:57:57,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:57:57,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:57:57,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:57:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:57:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:57:58,020 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 22:57:58,691 WARN L181 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-01-01 22:57:59,094 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-01 22:57:59,120 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:57:59,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:57:59,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:57:59,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:57:59,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:57:59,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:57:59,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:57:59,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:57:59,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-01 22:57:59,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:57:59,123 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:57:59,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:57:59,836 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:57:59,842 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:57:59,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:57:59,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:57:59,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:57:59,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:57:59,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:57:59,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:57:59,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:57:59,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:57:59,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:57:59,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:57:59,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:57:59,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:57:59,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:57:59,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:57:59,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:57:59,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:57:59,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:57:59,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:57:59,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:57:59,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:00,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:00,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:00,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:00,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:00,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:00,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:00,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:00,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:00,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:00,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:00,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:00,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:00,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:00,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:00,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:00,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:00,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:00,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:00,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:00,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:00,072 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:00,116 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:58:00,120 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:58:00,122 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:00,124 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:00,125 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:00,125 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-01 22:58:00,152 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:58:00,164 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:58:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:00,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:00,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:00,267 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:58:00,267 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:58:00,324 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-01 22:58:00,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:58:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-01 22:58:00,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 22:58:00,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:00,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 22:58:00,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:00,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 22:58:00,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:00,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2019-01-01 22:58:00,333 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2019-01-01 22:58:00,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2019-01-01 22:58:00,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-01 22:58:00,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 22:58:00,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2019-01-01 22:58:00,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:00,336 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-01-01 22:58:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2019-01-01 22:58:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2019-01-01 22:58:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-01 22:58:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-01 22:58:00,339 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-01 22:58:00,339 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-01 22:58:00,339 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:58:00,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-01-01 22:58:00,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:58:00,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:00,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:00,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:00,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:58:00,341 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-01 22:58:00,341 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-01 22:58:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2019-01-01 22:58:00,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:00,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:00,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:00,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:00,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:58:00,405 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:00,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:00,406 INFO L82 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2019-01-01 22:58:00,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:00,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:00,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:00,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:00,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:00,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:58:00,429 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:58:00,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:58:00,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:58:00,430 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 22:58:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:00,478 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-01-01 22:58:00,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:58:00,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-01-01 22:58:00,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:00,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2019-01-01 22:58:00,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 22:58:00,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 22:58:00,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-01-01 22:58:00,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:00,483 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-01 22:58:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-01-01 22:58:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 22:58:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 22:58:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-01-01 22:58:00,487 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-01 22:58:00,488 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-01-01 22:58:00,488 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:58:00,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-01-01 22:58:00,490 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:00,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:00,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:00,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:00,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:58:00,491 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-01 22:58:00,493 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-01 22:58:00,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:00,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2019-01-01 22:58:00,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:00,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:00,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:00,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:00,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:00,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:58:00,539 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:00,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:00,540 INFO L82 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2019-01-01 22:58:00,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:00,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:00,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:00,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:00,570 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-01 22:58:00,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:00,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:58:00,571 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:58:00,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:58:00,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:58:00,572 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-01 22:58:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:00,596 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-01 22:58:00,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:58:00,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2019-01-01 22:58:00,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:00,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2019-01-01 22:58:00,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-01 22:58:00,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 22:58:00,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-01-01 22:58:00,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:00,601 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-01-01 22:58:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-01-01 22:58:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-01-01 22:58:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 22:58:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-01-01 22:58:00,603 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-01 22:58:00,603 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-01-01 22:58:00,604 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:58:00,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-01-01 22:58:00,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:00,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:00,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:00,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:00,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:00,606 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-01 22:58:00,606 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-01 22:58:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2019-01-01 22:58:00,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:00,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:00,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:00,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:00,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:58:00,680 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:00,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2019-01-01 22:58:00,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:00,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:00,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:00,905 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-01 22:58:00,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:58:00,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:58:00,943 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-01 22:58:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:00,955 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-01-01 22:58:00,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:58:00,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2019-01-01 22:58:00,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:00,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2019-01-01 22:58:00,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-01 22:58:00,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 22:58:00,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2019-01-01 22:58:00,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:00,960 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 22:58:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2019-01-01 22:58:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-01 22:58:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 22:58:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-01-01 22:58:00,964 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 22:58:00,964 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-01-01 22:58:00,964 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:58:00,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-01-01 22:58:00,965 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:00,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:00,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:00,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:00,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:00,966 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-01 22:58:00,966 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-01 22:58:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2019-01-01 22:58:00,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:00,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:00,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:00,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:00,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:00,984 INFO L82 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2019-01-01 22:58:00,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:00,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:00,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:00,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:00,988 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:00,989 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:00,989 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-01 22:58:01,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:01,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:01,124 INFO L82 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2019-01-01 22:58:01,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:01,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:01,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:01,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:01,136 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:01,136 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:01,137 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-01 22:58:01,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:01,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:01,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:01,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 22:58:01,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:58:01,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:58:01,485 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-01-01 22:58:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:01,912 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-01-01 22:58:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:58:01,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-01-01 22:58:01,915 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2019-01-01 22:58:01,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2019-01-01 22:58:01,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-01-01 22:58:01,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-01-01 22:58:01,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-01-01 22:58:01,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:01,920 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-01-01 22:58:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-01-01 22:58:01,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2019-01-01 22:58:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 22:58:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-01-01 22:58:01,926 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 22:58:01,926 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-01-01 22:58:01,926 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:58:01,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2019-01-01 22:58:01,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:01,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:01,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:01,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:01,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:01,930 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-01 22:58:01,930 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-01 22:58:01,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:01,931 INFO L82 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2019-01-01 22:58:01,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:01,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:01,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:01,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:01,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:01,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2019-01-01 22:58:01,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:01,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:01,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:01,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:01,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:02,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2019-01-01 22:58:02,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:02,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:02,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:02,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:02,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:02,170 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-01 22:58:02,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:58:02,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 22:58:02,352 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-01 22:58:02,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:58:02,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:58:02,425 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-01-01 22:58:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:02,553 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-01-01 22:58:02,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:58:02,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2019-01-01 22:58:02,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:02,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 23 states and 27 transitions. [2019-01-01 22:58:02,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 22:58:02,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 22:58:02,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2019-01-01 22:58:02,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:02,556 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-01 22:58:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2019-01-01 22:58:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-01-01 22:58:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-01 22:58:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-01-01 22:58:02,559 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-01 22:58:02,559 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-01 22:58:02,559 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:58:02,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-01-01 22:58:02,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:02,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:02,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:02,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:02,561 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:02,561 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-01 22:58:02,561 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-01 22:58:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2019-01-01 22:58:02,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:02,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:02,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:02,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:02,568 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:02,568 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:02,568 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-01 22:58:02,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:02,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2019-01-01 22:58:02,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:02,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:02,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:02,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:02,680 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:02,680 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:02,680 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-01 22:58:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:58:02,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 22:58:02,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:02,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:02,787 INFO L82 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2019-01-01 22:58:02,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:02,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:02,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:02,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:02,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:02,797 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:02,805 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:02,805 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-01 22:58:02,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:02,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:02,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:58:02,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-01-01 22:58:03,071 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-01 22:58:03,343 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-01 22:58:03,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:58:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:58:03,344 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand 7 states. [2019-01-01 22:58:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:03,499 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-01-01 22:58:03,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:58:03,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2019-01-01 22:58:03,501 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2019-01-01 22:58:03,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2019-01-01 22:58:03,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-01-01 22:58:03,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-01 22:58:03,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2019-01-01 22:58:03,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:58:03,503 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-01-01 22:58:03,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2019-01-01 22:58:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2019-01-01 22:58:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-01 22:58:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-01-01 22:58:03,505 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-01 22:58:03,506 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-01 22:58:03,506 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:58:03,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-01-01 22:58:03,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:58:03,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:03,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:03,507 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:03,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:58:03,507 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-01 22:58:03,507 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-01 22:58:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2019-01-01 22:58:03,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:03,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:03,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:03,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:03,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:03,513 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:03,513 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:03,513 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-01 22:58:03,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:58:03,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:58:03,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:03,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2019-01-01 22:58:03,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:03,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:03,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:03,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:03,616 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:03,616 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:03,616 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-01 22:58:03,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:58:03,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-01-01 22:58:03,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2019-01-01 22:58:03,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:03,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:03,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:03,695 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:03,696 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:03,696 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-01 22:58:03,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:58:03,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:58:03,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:03,937 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-01 22:58:04,831 WARN L181 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 130 [2019-01-01 22:58:05,737 WARN L181 SmtUtils]: Spent 794.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 97 [2019-01-01 22:58:05,759 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:05,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:05,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:05,759 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:05,759 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:05,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:05,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:05,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:05,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration9_Lasso [2019-01-01 22:58:05,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:05,761 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:05,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,115 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-01-01 22:58:06,362 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-01-01 22:58:06,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,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-01 22:58:06,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,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-01 22:58:06,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:06,887 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2019-01-01 22:58:07,179 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-01-01 22:58:07,476 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-01-01 22:58:09,685 WARN L181 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-01-01 22:58:09,803 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:09,804 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:09,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:09,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:09,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:09,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:09,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:09,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:09,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:09,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:09,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:09,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:09,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:09,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:09,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:09,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:09,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:09,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:09,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:09,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:09,825 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:58:09,825 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2019-01-01 22:58:09,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:09,842 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-01 22:58:09,842 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-01-01 22:58:10,255 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:10,473 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-01 22:58:10,474 INFO L444 ModelExtractionUtils]: 37 out of 50 variables were initially zero. Simplification set additionally 9 variables to zero. [2019-01-01 22:58:10,474 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:10,478 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2019-01-01 22:58:10,479 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:10,479 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-01 22:58:10,533 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-01 22:58:10,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:58:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:10,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:10,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:11,001 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:58:11,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-01 22:58:11,284 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-01 22:58:11,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:58:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2019-01-01 22:58:11,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2019-01-01 22:58:11,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:11,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2019-01-01 22:58:11,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:11,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2019-01-01 22:58:11,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:11,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2019-01-01 22:58:11,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 22:58:11,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2019-01-01 22:58:11,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-01-01 22:58:11,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-01 22:58:11,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2019-01-01 22:58:11,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:11,289 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-01 22:58:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2019-01-01 22:58:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-01-01 22:58:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-01 22:58:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-01-01 22:58:11,291 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-01 22:58:11,291 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-01 22:58:11,291 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:58:11,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2019-01-01 22:58:11,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 22:58:11,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:11,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:11,293 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:11,293 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:11,293 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-01 22:58:11,293 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-01 22:58:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2019-01-01 22:58:11,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:11,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:11,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:11,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:11,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:11,299 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:11,299 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:11,300 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-01 22:58:11,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:11,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2019-01-01 22:58:11,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:11,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:11,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:11,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:11,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:11,439 INFO L82 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2019-01-01 22:58:11,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:11,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:11,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:11,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:11,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:11,447 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:11,447 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:11,447 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-01 22:58:11,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:11,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:11,848 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-01 22:58:11,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:58:11,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-01-01 22:58:12,359 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-01 22:58:12,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:58:12,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:58:12,390 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-01-01 22:58:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:12,516 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-01-01 22:58:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:58:12,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2019-01-01 22:58:12,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 22:58:12,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2019-01-01 22:58:12,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-01 22:58:12,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 22:58:12,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2019-01-01 22:58:12,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:12,520 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-01 22:58:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2019-01-01 22:58:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-01-01 22:58:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-01 22:58:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-01-01 22:58:12,526 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-01 22:58:12,526 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-01 22:58:12,526 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:58:12,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2019-01-01 22:58:12,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-01 22:58:12,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:12,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:12,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:12,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:12,535 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-01 22:58:12,535 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-01 22:58:12,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2019-01-01 22:58:12,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:12,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:12,549 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:12,549 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:12,549 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-01 22:58:12,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:58:12,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:58:12,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:12,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2019-01-01 22:58:12,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:12,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:12,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:12,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:12,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2019-01-01 22:58:12,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:12,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:12,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:12,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:12,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:12,679 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:12,680 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:12,680 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-01 22:58:12,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:58:12,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:58:12,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:13,040 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-01-01 22:58:15,105 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 206 DAG size of output: 180 [2019-01-01 22:58:20,283 WARN L181 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 218 DAG size of output: 123 [2019-01-01 22:58:20,286 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:20,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:20,287 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:20,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:20,287 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:20,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:20,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:20,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:20,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration11_Lasso [2019-01-01 22:58:20,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:20,287 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:20,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58: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-01 22:58:20,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:20,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:21,001 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-01-01 22:58:21,142 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-01-01 22:58:21,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:21,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:21,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:21,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:21,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:21,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:21,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:21,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:21,556 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-01 22:58:23,184 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2019-01-01 22:58:23,352 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:23,352 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:23,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:23,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:23,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:23,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:23,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:23,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:23,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:23,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:23,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:23,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:23,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:23,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:23,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,445 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:58:23,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,446 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:58:23,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:23,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:23,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:23,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:23,455 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:58:23,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:23,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:23,464 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:58:23,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:23,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:23,510 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:58:23,510 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 22:58:23,511 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:23,511 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:23,513 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:23,514 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-01 22:58:23,646 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-01-01 22:58:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:23,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:23,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 22:58:23,733 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:58:23,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 29 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 22:58:23,767 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-01 22:58:23,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:58:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-01-01 22:58:23,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 7 letters. [2019-01-01 22:58:23,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:23,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 25 letters. Loop has 7 letters. [2019-01-01 22:58:23,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:23,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 18 letters. Loop has 14 letters. [2019-01-01 22:58:23,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:23,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-01-01 22:58:23,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:23,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 31 states and 38 transitions. [2019-01-01 22:58:23,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 22:58:23,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-01 22:58:23,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-01-01 22:58:23,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:23,774 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-01-01 22:58:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-01-01 22:58:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-01 22:58:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 22:58:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-01-01 22:58:23,780 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-01 22:58:23,781 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-01-01 22:58:23,781 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 22:58:23,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2019-01-01 22:58:23,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:23,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:23,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:23,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:58:23,783 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:23,783 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-01 22:58:23,783 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-01 22:58:23,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:23,783 INFO L82 PathProgramCache]: Analyzing trace with hash 810779970, now seen corresponding path program 1 times [2019-01-01 22:58:23,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:23,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:23,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:23,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:23,791 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:23,791 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:23,791 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-01 22:58:23,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:23,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 1 times [2019-01-01 22:58:23,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:23,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:23,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:23,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 618057612, now seen corresponding path program 1 times [2019-01-01 22:58:23,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:23,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:23,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:23,919 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:23,921 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:23,922 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-01 22:58:23,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:24,346 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 22:58:25,942 WARN L181 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 210 DAG size of output: 183 [2019-01-01 22:58:31,167 WARN L181 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 221 DAG size of output: 126 [2019-01-01 22:58:31,170 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:58:31,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:58:31,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:58:31,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:58:31,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:58:31,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:58:31,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:58:31,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:58:31,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration12_Lasso [2019-01-01 22:58:31,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:58:31,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:58:31,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,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-01 22:58:31,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,887 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-01-01 22:58:31,996 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-01-01 22:58:31,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:31,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:32,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:32,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:32,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:32,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-01 22:58:32,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:32,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:32,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:32,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:32,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:58:32,358 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-01-01 22:58:32,970 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-01 22:58:33,060 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:58:33,061 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:58:33,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:33,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:33,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:33,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:33,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:33,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:33,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:33,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:33,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:33,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:33,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:33,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:33,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:33,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:33,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:33,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:33,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:33,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:33,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:33,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:33,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:33,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:33,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:33,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:33,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:33,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:33,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:33,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:33,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:33,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:33,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,121 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:58:33,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,122 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:58:33,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:33,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:58:33,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:58:33,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:58:33,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:33,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:33,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:58:33,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:58:33,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:33,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:58:33,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:58:33,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:58:33,151 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:58:33,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:58:33,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:58:33,155 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:58:33,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:58:33,213 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:58:33,260 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 22:58:33,263 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-01 22:58:33,263 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:58:33,264 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:58:33,264 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:58:33,264 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-01 22:58:33,417 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2019-01-01 22:58:33,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:33,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:33,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:33,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:58:33,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:58:33,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:58:33,536 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-01 22:58:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 22:58:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:58:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-01-01 22:58:33,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2019-01-01 22:58:33,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:33,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 23 letters. Loop has 4 letters. [2019-01-01 22:58:33,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:33,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 8 letters. [2019-01-01 22:58:33,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:58:33,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2019-01-01 22:58:33,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:33,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 37 states and 46 transitions. [2019-01-01 22:58:33,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 22:58:33,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 22:58:33,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2019-01-01 22:58:33,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:33,541 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-01-01 22:58:33,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2019-01-01 22:58:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-01-01 22:58:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 22:58:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-01-01 22:58:33,546 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-01-01 22:58:33,546 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-01-01 22:58:33,546 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 22:58:33,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 36 transitions. [2019-01-01 22:58:33,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:33,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:33,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:33,548 INFO L866 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-01 22:58:33,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:33,548 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-01 22:58:33,548 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-01 22:58:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:33,549 INFO L82 PathProgramCache]: Analyzing trace with hash 31459128, now seen corresponding path program 1 times [2019-01-01 22:58:33,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:33,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:33,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:33,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:33,566 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:33,567 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:33,567 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-01 22:58:33,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:33,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:33,785 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-01 22:58:33,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:58:33,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-01 22:58:33,806 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:33,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:33,806 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 2 times [2019-01-01 22:58:33,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:33,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:33,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:33,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:33,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:58:33,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:58:33,913 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. cyclomatic complexity: 10 Second operand 8 states. [2019-01-01 22:58:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:34,074 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2019-01-01 22:58:34,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 22:58:34,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 65 transitions. [2019-01-01 22:58:34,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:34,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 37 states and 44 transitions. [2019-01-01 22:58:34,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 22:58:34,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 22:58:34,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2019-01-01 22:58:34,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:34,078 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-01-01 22:58:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2019-01-01 22:58:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-01-01 22:58:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 22:58:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-01-01 22:58:34,081 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-01-01 22:58:34,081 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-01-01 22:58:34,081 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 22:58:34,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2019-01-01 22:58:34,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:34,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:34,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:34,082 INFO L866 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-01 22:58:34,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:34,083 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-01 22:58:34,083 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-01 22:58:34,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:34,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1103015548, now seen corresponding path program 2 times [2019-01-01 22:58:34,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:34,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:34,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:34,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:34,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:34,089 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:34,089 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:34,089 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-01 22:58:34,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:58:34,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:58:34,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:58:34,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:34,966 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-01 22:58:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:58:34,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-01-01 22:58:34,987 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:58:34,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:34,988 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 3 times [2019-01-01 22:58:34,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:34,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:34,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:34,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:34,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:35,121 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 22:58:35,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 22:58:35,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 22:58:35,148 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand 9 states. [2019-01-01 22:58:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:35,344 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-01-01 22:58:35,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 22:58:35,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2019-01-01 22:58:35,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:35,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2019-01-01 22:58:35,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-01 22:58:35,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-01 22:58:35,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2019-01-01 22:58:35,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:35,348 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2019-01-01 22:58:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2019-01-01 22:58:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-01-01 22:58:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 22:58:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-01-01 22:58:35,351 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-01 22:58:35,351 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-01-01 22:58:35,351 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 22:58:35,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 45 transitions. [2019-01-01 22:58:35,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:35,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:35,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:35,353 INFO L866 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-01 22:58:35,353 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:35,353 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-01 22:58:35,353 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-01 22:58:35,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:35,354 INFO L82 PathProgramCache]: Analyzing trace with hash 545700084, now seen corresponding path program 3 times [2019-01-01 22:58:35,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:35,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:35,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:35,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:35,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:35,359 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:35,359 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:35,359 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-01 22:58:35,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:58:35,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 22:58:35,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 4 times [2019-01-01 22:58:35,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:35,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:35,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:35,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:35,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1677403586, now seen corresponding path program 1 times [2019-01-01 22:58:35,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:35,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:35,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:35,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:35,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:35,542 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:35,542 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:35,542 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-01 22:58:35,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:58:35,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:36,198 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-01 22:58:36,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:58:36,219 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-01 22:58:36,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:58:36,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:58:36,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:58:36,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:3 [2019-01-01 22:58:36,251 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-01 22:58:36,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:58:36,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-01-01 22:58:36,500 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 22:58:36,617 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 22:58:36,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 22:58:36,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-01-01 22:58:36,618 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. cyclomatic complexity: 11 Second operand 18 states. [2019-01-01 22:58:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:37,411 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2019-01-01 22:58:37,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 22:58:37,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 146 transitions. [2019-01-01 22:58:37,414 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:58:37,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 146 transitions. [2019-01-01 22:58:37,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2019-01-01 22:58:37,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-01-01 22:58:37,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 146 transitions. [2019-01-01 22:58:37,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:37,416 INFO L705 BuchiCegarLoop]: Abstraction has 118 states and 146 transitions. [2019-01-01 22:58:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 146 transitions. [2019-01-01 22:58:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 75. [2019-01-01 22:58:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-01 22:58:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-01-01 22:58:37,422 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-01-01 22:58:37,423 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-01-01 22:58:37,423 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 22:58:37,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 91 transitions. [2019-01-01 22:58:37,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:37,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:37,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:37,425 INFO L866 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-01 22:58:37,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:37,425 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-01 22:58:37,425 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-01 22:58:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash -134358286, now seen corresponding path program 2 times [2019-01-01 22:58:37,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:37,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:37,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:58:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:37,430 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:37,431 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:37,431 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-01 22:58:37,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:58:37,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:58:37,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:37,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:37,581 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 5 times [2019-01-01 22:58:37,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:37,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:37,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:37,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:37,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:37,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:37,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1090597572, now seen corresponding path program 3 times [2019-01-01 22:58:37,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:37,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:37,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:37,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:37,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:37,594 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:37,594 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:37,594 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-01 22:58:37,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:58:37,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 22:58:37,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:58:37,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:58:37,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:58:37,763 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-01 22:58:37,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:58:37,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:58:37,907 INFO L303 Elim1Store]: Index analysis took 141 ms [2019-01-01 22:58:37,926 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-01 22:58:38,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:58:38,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:58:38,004 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-01 22:58:38,006 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:58:38,023 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-01 22:58:38,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:58:38,034 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-01 22:58:38,035 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:69, output treesize:23 [2019-01-01 22:58:38,060 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-01 22:58:38,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:58:38,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:58:38,065 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-01 22:58:38,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:58:38,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:58:38,073 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-01 22:58:38,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:5 [2019-01-01 22:58:38,092 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-01 22:58:38,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:58:38,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-01 22:58:38,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:58:38,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:58:38,202 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. cyclomatic complexity: 22 Second operand 7 states. [2019-01-01 22:58:38,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:58:38,377 INFO L93 Difference]: Finished difference Result 130 states and 159 transitions. [2019-01-01 22:58:38,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:58:38,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 159 transitions. [2019-01-01 22:58:38,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:58:38,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 159 transitions. [2019-01-01 22:58:38,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-01 22:58:38,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-01-01 22:58:38,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 159 transitions. [2019-01-01 22:58:38,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:58:38,384 INFO L705 BuchiCegarLoop]: Abstraction has 130 states and 159 transitions. [2019-01-01 22:58:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 159 transitions. [2019-01-01 22:58:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 90. [2019-01-01 22:58:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 22:58:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2019-01-01 22:58:38,390 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-01-01 22:58:38,390 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-01-01 22:58:38,391 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-01 22:58:38,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 111 transitions. [2019-01-01 22:58:38,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 22:58:38,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:58:38,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:58:38,392 INFO L866 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-01 22:58:38,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 22:58:38,393 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-01 22:58:38,393 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-01 22:58:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash 543853042, now seen corresponding path program 4 times [2019-01-01 22:58:38,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:38,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:38,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:38,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:38,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:38,398 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:38,399 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:38,399 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-01 22:58:38,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 22:58:38,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 22:58:38,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:38,538 INFO L82 PathProgramCache]: Analyzing trace with hash 3789515, now seen corresponding path program 6 times [2019-01-01 22:58:38,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:38,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:38,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:38,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:38,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:58:38,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1937505340, now seen corresponding path program 5 times [2019-01-01 22:58:38,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:58:38,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:58:38,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:38,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:58:38,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:58:38,550 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-01 22:58:38,550 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-01 22:58:38,550 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-01 22:58:38,561 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-01 22:58:39,022 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-01 22:58:39,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-01 22:58:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:58:46,320 WARN L181 SmtUtils]: Spent 7.08 s on a formula simplification. DAG size of input: 328 DAG size of output: 272 [2019-01-01 23:08:47,260 WARN L181 SmtUtils]: Spent 9.96 m on a formula simplification. DAG size of input: 738 DAG size of output: 185 [2019-01-01 23:08:47,264 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:08:47,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:08:47,264 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:08:47,264 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:08:47,264 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:08:47,264 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:08:47,264 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:08:47,265 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:08:47,265 INFO L131 ssoRankerPreferences]: Filename of dumped script: bubble_sort_true-unreach-call_true-termination.i_Iteration17_Lasso [2019-01-01 23:08:47,265 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:08:47,265 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:08:47,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:08:47,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:08:47,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:08:47,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:08:47,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:08:47,756 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-01 23:08:47,761 INFO L168 Benchmark]: Toolchain (without parser) took 651975.20 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 440.4 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -371.0 MB). Peak memory consumption was 689.6 MB. Max. memory is 11.5 GB. [2019-01-01 23:08:47,771 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:08:47,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.92 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:08:47,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.42 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:08:47,772 INFO L168 Benchmark]: Boogie Preprocessor took 145.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:08:47,776 INFO L168 Benchmark]: RCFGBuilder took 706.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:08:47,777 INFO L168 Benchmark]: BuchiAutomizer took 650700.20 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -248.6 MB). Peak memory consumption was 698.8 MB. Max. memory is 11.5 GB. [2019-01-01 23:08:47,788 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.92 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.42 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 145.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 706.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 650700.20 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -248.6 MB). Peak memory consumption was 698.8 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...