./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9722a10940ebd7a5d75170225a40cd37454d0528 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 11:08:41,144 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:08:41,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:08:41,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:08:41,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:08:41,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:08:41,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:08:41,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:08:41,154 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:08:41,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:08:41,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:08:41,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:08:41,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:08:41,157 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:08:41,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:08:41,158 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:08:41,158 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:08:41,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:08:41,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:08:41,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:08:41,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:08:41,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:08:41,165 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:08:41,165 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:08:41,165 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:08:41,165 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:08:41,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:08:41,166 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:08:41,167 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:08:41,168 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:08:41,168 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:08:41,168 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:08:41,168 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:08:41,169 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:08:41,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:08:41,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:08:41,170 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:08:41,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:08:41,179 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:08:41,180 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:08:41,180 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:08:41,180 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:08:41,180 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:08:41,180 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:08:41,180 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:08:41,181 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:08:41,181 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:08:41,181 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:08:41,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:08:41,181 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:08:41,181 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:08:41,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:08:41,181 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:08:41,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:08:41,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:08:41,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:08:41,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:08:41,182 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:08:41,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:08:41,182 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:08:41,183 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:08:41,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:08:41,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:08:41,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:08:41,183 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:08:41,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:08:41,183 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:08:41,184 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:08:41,184 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:08:41,184 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2018-11-18 11:08:41,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:08:41,216 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:08:41,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:08:41,220 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:08:41,220 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:08:41,221 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-18 11:08:41,265 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/data/1d69112ad/b01a2bec72dd49bd9e19caa225f71d64/FLAG88dd498ec [2018-11-18 11:08:41,682 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:08:41,683 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-18 11:08:41,688 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/data/1d69112ad/b01a2bec72dd49bd9e19caa225f71d64/FLAG88dd498ec [2018-11-18 11:08:41,700 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/data/1d69112ad/b01a2bec72dd49bd9e19caa225f71d64 [2018-11-18 11:08:41,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:08:41,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:08:41,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:08:41,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:08:41,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:08:41,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c9246a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41, skipping insertion in model container [2018-11-18 11:08:41,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:08:41,733 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:08:41,849 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:08:41,851 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:08:41,865 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:08:41,876 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:08:41,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41 WrapperNode [2018-11-18 11:08:41,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:08:41,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:08:41,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:08:41,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:08:41,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:08:41,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:08:41,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:08:41,899 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:08:41,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... [2018-11-18 11:08:41,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:08:41,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:08:41,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:08:41,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:08:41,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:08:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:08:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:08:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:08:41,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:08:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:08:41,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:08:42,140 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:08:42,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:08:42 BoogieIcfgContainer [2018-11-18 11:08:42,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:08:42,141 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:08:42,141 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:08:42,143 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:08:42,144 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:08:42,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:08:41" (1/3) ... [2018-11-18 11:08:42,144 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d69e5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:08:42, skipping insertion in model container [2018-11-18 11:08:42,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:08:42,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:08:41" (2/3) ... [2018-11-18 11:08:42,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d69e5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:08:42, skipping insertion in model container [2018-11-18 11:08:42,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:08:42,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:08:42" (3/3) ... [2018-11-18 11:08:42,147 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-18 11:08:42,185 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:08:42,185 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:08:42,185 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:08:42,185 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:08:42,185 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:08:42,185 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:08:42,186 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:08:42,186 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:08:42,186 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:08:42,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-18 11:08:42,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-18 11:08:42,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:42,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:42,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:08:42,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:08:42,212 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:08:42,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-18 11:08:42,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-18 11:08:42,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:42,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:42,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:08:42,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:08:42,218 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 13#L14-4true [2018-11-18 11:08:42,219 INFO L796 eck$LassoCheckResult]: Loop: 13#L14-4true assume true; 22#L14-1true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 17#L17-6true assume !true; 14#L17-7true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 18#L14-3true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 13#L14-4true [2018-11-18 11:08:42,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 11:08:42,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:42,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:42,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:42,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:42,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:42,302 INFO L82 PathProgramCache]: Analyzing trace with hash 34534785, now seen corresponding path program 1 times [2018-11-18 11:08:42,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:42,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:42,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:42,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:42,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:42,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:08:42,333 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:08:42,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:08:42,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:08:42,343 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-18 11:08:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:42,350 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-18 11:08:42,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:08:42,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 27 transitions. [2018-11-18 11:08:42,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-18 11:08:42,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 22 transitions. [2018-11-18 11:08:42,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-18 11:08:42,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 11:08:42,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2018-11-18 11:08:42,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:08:42,359 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 11:08:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2018-11-18 11:08:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 11:08:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 11:08:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-11-18 11:08:42,383 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 11:08:42,383 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2018-11-18 11:08:42,383 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:08:42,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2018-11-18 11:08:42,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-18 11:08:42,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:42,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:42,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 11:08:42,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:42,385 INFO L794 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 63#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 64#L14-4 [2018-11-18 11:08:42,385 INFO L796 eck$LassoCheckResult]: Loop: 64#L14-4 assume true; 65#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 58#L17-6 assume true; 56#L17-1 main_#t~short4 := main_~i~0 >= 0; 54#L17-2 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 55#L17-4 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 66#L17-7 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 67#L14-3 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 64#L14-4 [2018-11-18 11:08:42,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 11:08:42,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:42,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:42,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:42,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1677838032, now seen corresponding path program 1 times [2018-11-18 11:08:42,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:42,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:08:42,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:42,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1926567790, now seen corresponding path program 1 times [2018-11-18 11:08:42,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:42,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:42,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:42,586 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-11-18 11:08:42,681 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:08:42,682 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:08:42,682 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:08:42,682 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:08:42,682 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:08:42,683 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:08:42,683 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:08:42,683 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:08:42,683 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration2_Lasso [2018-11-18 11:08:42,683 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:08:42,683 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:08:42,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:42,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,175 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:08:43,178 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:08:43,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:43,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:43,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:43,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:43,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:43,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:43,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:43,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:43,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:43,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:43,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:43,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:43,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:43,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:43,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:43,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:43,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:43,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:43,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:43,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:43,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:43,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:43,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:43,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:43,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:43,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:43,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:43,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:43,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:43,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:43,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:43,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:43,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:43,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:43,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:43,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:43,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:43,199 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:08:43,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:43,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:43,200 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:08:43,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:43,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:43,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:43,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:43,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:43,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:43,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:43,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:43,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:43,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:43,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:43,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:43,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:43,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:43,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:43,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:43,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:43,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:43,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:43,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:43,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:43,215 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:08:43,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:43,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:43,220 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:08:43,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:43,262 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:08:43,309 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-18 11:08:43,309 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 11:08:43,311 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:08:43,312 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:08:43,313 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:08:43,313 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~#v~0.offset, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 1*ULTIMATE.start_main_~#v~0.offset - 4*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-18 11:08:43,328 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-18 11:08:43,334 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:08:43,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:43,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:43,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:43,399 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 11:08:43,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-18 11:08:43,445 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 34 states and 43 transitions. Complement of second has 6 states. [2018-11-18 11:08:43,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:08:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:08:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-18 11:08:43,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-18 11:08:43,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:43,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-18 11:08:43,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:43,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-18 11:08:43,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:43,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-11-18 11:08:43,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 11:08:43,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 26 states and 34 transitions. [2018-11-18 11:08:43,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-18 11:08:43,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 11:08:43,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2018-11-18 11:08:43,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:08:43,451 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-18 11:08:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2018-11-18 11:08:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-18 11:08:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 11:08:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-11-18 11:08:43,453 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-18 11:08:43,453 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-11-18 11:08:43,453 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:08:43,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2018-11-18 11:08:43,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 11:08:43,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:43,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:43,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 11:08:43,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:08:43,455 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 183#L14-4 assume true; 185#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 174#L17-6 [2018-11-18 11:08:43,455 INFO L796 eck$LassoCheckResult]: Loop: 174#L17-6 assume true; 171#L17-1 main_#t~short4 := main_~i~0 >= 0; 167#L17-2 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 168#L17-4 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 177#L18 assume !(main_~i~0 < 2); 173#L18-2 main_~i~0 := main_~i~0 - 1; 174#L17-6 [2018-11-18 11:08:43,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2018-11-18 11:08:43,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:43,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:43,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1333264589, now seen corresponding path program 1 times [2018-11-18 11:08:43,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:43,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:43,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:43,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:43,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1926566060, now seen corresponding path program 1 times [2018-11-18 11:08:43,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:43,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:43,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:43,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:43,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:43,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:08:43,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:08:43,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:08:43,599 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 11:08:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:43,650 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2018-11-18 11:08:43,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:08:43,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 71 transitions. [2018-11-18 11:08:43,652 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 27 [2018-11-18 11:08:43,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 71 transitions. [2018-11-18 11:08:43,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 11:08:43,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 11:08:43,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 71 transitions. [2018-11-18 11:08:43,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:08:43,653 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-18 11:08:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 71 transitions. [2018-11-18 11:08:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2018-11-18 11:08:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 11:08:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2018-11-18 11:08:43,657 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2018-11-18 11:08:43,657 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2018-11-18 11:08:43,657 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:08:43,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2018-11-18 11:08:43,658 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-18 11:08:43,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:43,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:43,658 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-18 11:08:43,658 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:08:43,659 INFO L794 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 279#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 280#L14-4 assume true; 282#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 290#L17-6 [2018-11-18 11:08:43,659 INFO L796 eck$LassoCheckResult]: Loop: 290#L17-6 assume true; 265#L17-1 main_#t~short4 := main_~i~0 >= 0; 261#L17-2 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 262#L17-4 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 272#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 273#L18-2 main_~i~0 := main_~i~0 - 1; 290#L17-6 [2018-11-18 11:08:43,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 2 times [2018-11-18 11:08:43,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:43,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:43,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:43,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1333264527, now seen corresponding path program 1 times [2018-11-18 11:08:43,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:43,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:43,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:08:43,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:43,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1926566122, now seen corresponding path program 1 times [2018-11-18 11:08:43,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:43,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:43,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:43,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:43,888 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:08:43,888 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:08:43,888 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:08:43,889 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:08:43,889 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:08:43,889 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:08:43,889 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:08:43,889 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:08:43,889 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration4_Lasso [2018-11-18 11:08:43,889 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:08:43,889 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:08:43,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:43,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:44,082 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:08:44,083 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:08:44,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:44,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:44,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:44,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:44,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:44,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:44,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:44,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:44,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:44,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,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 [2018-11-18 11:08:44,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:44,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:44,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:44,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:44,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:44,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:44,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:44,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:44,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:44,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:44,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:44,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:44,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,099 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:44,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:44,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:44,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:44,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:44,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,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 [2018-11-18 11:08:44,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:44,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:44,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:44,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:44,105 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:44,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:44,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:44,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:44,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:44,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:44,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:44,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:44,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:44,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:44,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:44,128 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:08:44,133 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:08:44,133 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:08:44,133 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:08:44,134 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:08:44,134 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:08:44,134 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2 + 16*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-18 11:08:44,156 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-18 11:08:44,160 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:08:44,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:44,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:44,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:44,211 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 11:08:44,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 52 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-18 11:08:44,262 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 52 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 118 states and 140 transitions. Complement of second has 9 states. [2018-11-18 11:08:44,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 11:08:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:08:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2018-11-18 11:08:44,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-18 11:08:44,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:44,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-18 11:08:44,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:44,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-18 11:08:44,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:44,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 140 transitions. [2018-11-18 11:08:44,266 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 32 [2018-11-18 11:08:44,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 91 states and 111 transitions. [2018-11-18 11:08:44,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-18 11:08:44,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-18 11:08:44,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 111 transitions. [2018-11-18 11:08:44,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:08:44,272 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 111 transitions. [2018-11-18 11:08:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 111 transitions. [2018-11-18 11:08:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2018-11-18 11:08:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 11:08:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-11-18 11:08:44,276 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-11-18 11:08:44,276 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-11-18 11:08:44,276 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:08:44,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 78 transitions. [2018-11-18 11:08:44,277 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-18 11:08:44,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:44,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:44,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 11:08:44,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:08:44,278 INFO L794 eck$LassoCheckResult]: Stem: 514#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 505#L14-4 assume true; 509#L14-1 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 501#L14-5 main_~k~0 := 1; 502#L24-4 [2018-11-18 11:08:44,278 INFO L796 eck$LassoCheckResult]: Loop: 502#L24-4 assume true; 503#L24-1 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 517#L4 assume !(0 == __VERIFIER_assert_~cond); 518#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem8;havoc main_#t~mem7; 513#L24-3 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 502#L24-4 [2018-11-18 11:08:44,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash 28694823, now seen corresponding path program 1 times [2018-11-18 11:08:44,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:44,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,287 INFO L82 PathProgramCache]: Analyzing trace with hash 75551065, now seen corresponding path program 1 times [2018-11-18 11:08:44,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1482866675, now seen corresponding path program 1 times [2018-11-18 11:08:44,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:44,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:44,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:08:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:08:44,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:08:44,509 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. cyclomatic complexity: 23 Second operand 4 states. [2018-11-18 11:08:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:44,560 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-11-18 11:08:44,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:08:44,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 82 transitions. [2018-11-18 11:08:44,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-18 11:08:44,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 64 states and 79 transitions. [2018-11-18 11:08:44,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 11:08:44,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-18 11:08:44,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 79 transitions. [2018-11-18 11:08:44,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:08:44,563 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-18 11:08:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 79 transitions. [2018-11-18 11:08:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-18 11:08:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 11:08:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2018-11-18 11:08:44,566 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 77 transitions. [2018-11-18 11:08:44,566 INFO L608 BuchiCegarLoop]: Abstraction has 62 states and 77 transitions. [2018-11-18 11:08:44,566 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:08:44,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 77 transitions. [2018-11-18 11:08:44,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-18 11:08:44,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:44,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:44,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 11:08:44,567 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:08:44,567 INFO L794 eck$LassoCheckResult]: Stem: 652#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 642#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 643#L14-4 assume true; 645#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 655#L17-6 assume true; 660#L17-1 [2018-11-18 11:08:44,567 INFO L796 eck$LassoCheckResult]: Loop: 660#L17-1 main_#t~short4 := main_~i~0 >= 0; 672#L17-2 assume !main_#t~short4; 671#L17-4 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 635#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 636#L18-2 main_~i~0 := main_~i~0 - 1; 673#L17-6 assume true; 660#L17-1 [2018-11-18 11:08:44,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,568 INFO L82 PathProgramCache]: Analyzing trace with hash 28694855, now seen corresponding path program 1 times [2018-11-18 11:08:44,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:44,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1395381749, now seen corresponding path program 1 times [2018-11-18 11:08:44,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:44,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:44,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:44,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:08:44,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:08:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:08:44,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:08:44,584 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. cyclomatic complexity: 22 Second operand 3 states. [2018-11-18 11:08:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:44,595 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-18 11:08:44,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:08:44,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 62 transitions. [2018-11-18 11:08:44,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 11:08:44,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 38 states and 46 transitions. [2018-11-18 11:08:44,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 11:08:44,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 11:08:44,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2018-11-18 11:08:44,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:08:44,596 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-18 11:08:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2018-11-18 11:08:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-18 11:08:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 11:08:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2018-11-18 11:08:44,598 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-18 11:08:44,598 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2018-11-18 11:08:44,598 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:08:44,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2018-11-18 11:08:44,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 11:08:44,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:44,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:44,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:44,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:08:44,599 INFO L794 eck$LassoCheckResult]: Stem: 769#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 760#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 761#L14-4 assume true; 764#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 752#L17-6 assume true; 754#L17-1 main_#t~short4 := main_~i~0 >= 0; 747#L17-2 assume !main_#t~short4; 748#L17-4 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 762#L17-7 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 763#L14-3 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 765#L14-4 assume true; 766#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 750#L17-6 [2018-11-18 11:08:44,599 INFO L796 eck$LassoCheckResult]: Loop: 750#L17-6 assume true; 753#L17-1 main_#t~short4 := main_~i~0 >= 0; 745#L17-2 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 746#L17-4 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 755#L18 assume !(main_~i~0 < 2); 749#L18-2 main_~i~0 := main_~i~0 - 1; 750#L17-6 [2018-11-18 11:08:44,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash -243483115, now seen corresponding path program 1 times [2018-11-18 11:08:44,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:44,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:08:44,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:08:44,626 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:08:44,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1333264589, now seen corresponding path program 2 times [2018-11-18 11:08:44,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:08:44,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:08:44,681 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 11:08:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:44,714 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-18 11:08:44,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:08:44,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 82 transitions. [2018-11-18 11:08:44,714 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-18 11:08:44,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 68 states and 82 transitions. [2018-11-18 11:08:44,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-18 11:08:44,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-18 11:08:44,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 82 transitions. [2018-11-18 11:08:44,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:08:44,715 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 82 transitions. [2018-11-18 11:08:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 82 transitions. [2018-11-18 11:08:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 42. [2018-11-18 11:08:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 11:08:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-11-18 11:08:44,718 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-18 11:08:44,718 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-11-18 11:08:44,718 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:08:44,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 51 transitions. [2018-11-18 11:08:44,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-11-18 11:08:44,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:44,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:44,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:44,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:08:44,720 INFO L794 eck$LassoCheckResult]: Stem: 886#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 877#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 878#L14-4 assume true; 879#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 896#L17-6 assume true; 866#L17-1 main_#t~short4 := main_~i~0 >= 0; 867#L17-2 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 893#L17-4 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 883#L17-7 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 884#L14-3 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 880#L14-4 assume true; 881#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 869#L17-6 [2018-11-18 11:08:44,720 INFO L796 eck$LassoCheckResult]: Loop: 869#L17-6 assume true; 865#L17-1 main_#t~short4 := main_~i~0 >= 0; 861#L17-2 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 862#L17-4 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 872#L18 assume !(main_~i~0 < 2); 868#L18-2 main_~i~0 := main_~i~0 - 1; 869#L17-6 [2018-11-18 11:08:44,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,720 INFO L82 PathProgramCache]: Analyzing trace with hash -300741417, now seen corresponding path program 2 times [2018-11-18 11:08:44,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:08:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1333264589, now seen corresponding path program 3 times [2018-11-18 11:08:44,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:08:44,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,740 INFO L82 PathProgramCache]: Analyzing trace with hash 646419747, now seen corresponding path program 1 times [2018-11-18 11:08:44,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:08:44,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:44,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:08:44,767 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f06e2dde-1627-4040-b016-d45d387c02b4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 11:08:44,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:44,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:44,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 11:08:44,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-18 11:08:44,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:08:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:08:44,889 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-18 11:08:44,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:08:44,947 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2018-11-18 11:08:44,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:08:44,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 113 transitions. [2018-11-18 11:08:44,948 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 33 [2018-11-18 11:08:44,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 96 states and 113 transitions. [2018-11-18 11:08:44,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-18 11:08:44,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-18 11:08:44,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 113 transitions. [2018-11-18 11:08:44,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:08:44,949 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 113 transitions. [2018-11-18 11:08:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 113 transitions. [2018-11-18 11:08:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2018-11-18 11:08:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 11:08:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2018-11-18 11:08:44,951 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 76 transitions. [2018-11-18 11:08:44,952 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 76 transitions. [2018-11-18 11:08:44,952 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 11:08:44,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 76 transitions. [2018-11-18 11:08:44,952 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-18 11:08:44,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:44,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:44,953 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:44,953 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 11:08:44,953 INFO L794 eck$LassoCheckResult]: Stem: 1089#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1080#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 1081#L14-4 assume true; 1084#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 1119#L17-6 assume true; 1116#L17-1 main_#t~short4 := main_~i~0 >= 0; 1111#L17-2 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 1109#L17-4 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 1082#L17-7 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1083#L14-3 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 1085#L14-4 assume true; 1086#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 1069#L17-6 [2018-11-18 11:08:44,953 INFO L796 eck$LassoCheckResult]: Loop: 1069#L17-6 assume true; 1072#L17-1 main_#t~short4 := main_~i~0 >= 0; 1064#L17-2 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 1065#L17-4 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 1075#L18 assume main_~i~0 < 2;call main_#t~mem5 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem5, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem5; 1068#L18-2 main_~i~0 := main_~i~0 - 1; 1069#L17-6 [2018-11-18 11:08:44,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,953 INFO L82 PathProgramCache]: Analyzing trace with hash -300741417, now seen corresponding path program 3 times [2018-11-18 11:08:44,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:44,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1333264527, now seen corresponding path program 2 times [2018-11-18 11:08:44,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:08:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:44,979 INFO L82 PathProgramCache]: Analyzing trace with hash 646419685, now seen corresponding path program 1 times [2018-11-18 11:08:44,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:44,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:44,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:08:44,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:44,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:45,218 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2018-11-18 11:08:45,340 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-11-18 11:08:45,342 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:08:45,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:08:45,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:08:45,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:08:45,343 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:08:45,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:08:45,343 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:08:45,343 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:08:45,343 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration9_Lasso [2018-11-18 11:08:45,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:08:45,343 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:08:45,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:45,605 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:08:45,605 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:08:45,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:45,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:45,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:45,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:45,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:45,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:45,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:45,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:45,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:45,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:45,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:45,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:45,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:45,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:45,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:45,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:45,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:45,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:45,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:45,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:45,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:45,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:45,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:45,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:45,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:45,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:45,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:45,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:45,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:45,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:45,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:45,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:45,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:45,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:45,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:45,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:45,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:45,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:45,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:45,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:45,615 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:45,615 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:45,624 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:08:45,632 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:08:45,632 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:08:45,632 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:08:45,633 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:08:45,633 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:08:45,633 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-18 11:08:45,651 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-18 11:08:45,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:45,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:45,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:45,691 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 11:08:45,691 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 76 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-18 11:08:45,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 76 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 114 states and 133 transitions. Complement of second has 9 states. [2018-11-18 11:08:45,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 11:08:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:08:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-18 11:08:45,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 11:08:45,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:45,717 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:08:45,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:45,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:45,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:45,761 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 11:08:45,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 76 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-18 11:08:45,783 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 76 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 114 states and 133 transitions. Complement of second has 9 states. [2018-11-18 11:08:45,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 11:08:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:08:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-18 11:08:45,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 11:08:45,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:45,786 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:08:45,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:45,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:45,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:45,820 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 11:08:45,820 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 76 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-18 11:08:45,846 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 76 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 150 states and 181 transitions. Complement of second has 8 states. [2018-11-18 11:08:45,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 11:08:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:08:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-18 11:08:45,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 11:08:45,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:45,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-18 11:08:45,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:45,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 12 letters. Loop has 12 letters. [2018-11-18 11:08:45,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:45,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 181 transitions. [2018-11-18 11:08:45,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-18 11:08:45,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 78 states and 92 transitions. [2018-11-18 11:08:45,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-18 11:08:45,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-18 11:08:45,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 92 transitions. [2018-11-18 11:08:45,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:08:45,850 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 92 transitions. [2018-11-18 11:08:45,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 92 transitions. [2018-11-18 11:08:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2018-11-18 11:08:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-18 11:08:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-18 11:08:45,852 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-18 11:08:45,852 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-18 11:08:45,852 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 11:08:45,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 61 transitions. [2018-11-18 11:08:45,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 11:08:45,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:08:45,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:08:45,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:08:45,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 11:08:45,853 INFO L794 eck$LassoCheckResult]: Stem: 1759#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1750#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~mem2, main_#t~mem5, main_#t~mem3, main_#t~short4, main_#t~post1, main_#t~mem7, main_#t~mem8, main_#t~post6, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.alloc(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 1; 1751#L14-4 assume true; 1752#L14-1 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem2 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem2;havoc main_#t~mem2;main_~i~0 := main_~j~0 - 1; 1788#L17-6 assume true; 1789#L17-1 main_#t~short4 := main_~i~0 >= 0; 1740#L17-2 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 > main_~key~0; 1741#L17-4 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 1756#L17-7 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1757#L14-3 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 1753#L14-4 assume true; 1754#L14-1 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1747#L14-5 main_~k~0 := 1; 1748#L24-4 [2018-11-18 11:08:45,853 INFO L796 eck$LassoCheckResult]: Loop: 1748#L24-4 assume true; 1749#L24-1 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem7 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem8 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond := (if main_#t~mem7 <= main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1762#L4 assume !(0 == __VERIFIER_assert_~cond); 1763#L4-2 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem8;havoc main_#t~mem7; 1758#L24-3 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1748#L24-4 [2018-11-18 11:08:45,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:45,853 INFO L82 PathProgramCache]: Analyzing trace with hash -733049352, now seen corresponding path program 1 times [2018-11-18 11:08:45,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:45,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:45,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:45,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:45,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:45,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:45,866 INFO L82 PathProgramCache]: Analyzing trace with hash 75551065, now seen corresponding path program 2 times [2018-11-18 11:08:45,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:45,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:45,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:08:45,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:45,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash -239114814, now seen corresponding path program 1 times [2018-11-18 11:08:45,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:08:45,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:08:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:45,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:08:45,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:08:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:08:46,136 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:08:46,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:08:46,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:08:46,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:08:46,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:08:46,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:08:46,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:08:46,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:08:46,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration10_Lasso [2018-11-18 11:08:46,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:08:46,137 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:08:46,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:08:46,496 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:08:46,496 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:08:46,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:46,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:46,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:46,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:46,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:46,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:46,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:46,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:46,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:46,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:46,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:46,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:46,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:46,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:46,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:46,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:46,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:46,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:46,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:46,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:46,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:46,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:46,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:46,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:46,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:46,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:46,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:46,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:46,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:46,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:46,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:46,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:46,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:46,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:46,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:46,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:46,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:46,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:46,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:46,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:46,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:46,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:46,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:46,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:46,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:46,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:46,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:46,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:46,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:46,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:46,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:46,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:46,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:46,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:46,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:46,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:08:46,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:46,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:46,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:46,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:08:46,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:08:46,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:08:46,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:08:46,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:08:46,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:08:46,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:08:46,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:08:46,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:08:46,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:08:46,518 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:08:46,525 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:08:46,526 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:08:46,526 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:08:46,527 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:08:46,527 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:08:46,527 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_4, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_4 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2018-11-18 11:08:46,563 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-18 11:08:46,564 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 11:08:46,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:08:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:46,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:08:46,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:08:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:08:46,610 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 11:08:46,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-18 11:08:46,618 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 61 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 55 states and 67 transitions. Complement of second has 6 states. [2018-11-18 11:08:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:08:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 11:08:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-18 11:08:46,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-18 11:08:46,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:46,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 18 letters. Loop has 5 letters. [2018-11-18 11:08:46,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:46,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 10 letters. [2018-11-18 11:08:46,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:08:46,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 67 transitions. [2018-11-18 11:08:46,621 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:08:46,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2018-11-18 11:08:46,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:08:46,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:08:46,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:08:46,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:08:46,622 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:08:46,622 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:08:46,622 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:08:46,622 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 11:08:46,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:08:46,622 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:08:46,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:08:46,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:08:46 BoogieIcfgContainer [2018-11-18 11:08:46,629 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:08:46,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:08:46,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:08:46,630 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:08:46,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:08:42" (3/4) ... [2018-11-18 11:08:46,633 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:08:46,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:08:46,634 INFO L168 Benchmark]: Toolchain (without parser) took 4930.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -187.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:08:46,634 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:08:46,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.70 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:46,635 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.59 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:46,636 INFO L168 Benchmark]: Boogie Preprocessor took 51.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:46,637 INFO L168 Benchmark]: RCFGBuilder took 190.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:46,637 INFO L168 Benchmark]: BuchiAutomizer took 4488.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-18 11:08:46,638 INFO L168 Benchmark]: Witness Printer took 3.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:08:46,641 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.70 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 21.59 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 190.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4488.14 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -1 * v + -4 * j and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[v] + 16 * i and consists of 5 locations. One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[v] + -1 * v and consists of 4 locations. One nondeterministic module has affine ranking function 2 * i + 1 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 137 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 63 states and ocurred in iteration 8. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 243 SDtfs, 376 SDslu, 283 SDs, 0 SdLazy, 241 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf99 lsp95 ukn66 mio100 lsp78 div205 bol100 ite100 ukn100 eq147 hnf59 smp88 dnf122 smp90 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...