./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/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_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/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-0cd3be1 [2018-11-28 13:09:35,790 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:09:35,791 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:09:35,798 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:09:35,798 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:09:35,799 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:09:35,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:09:35,800 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:09:35,802 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:09:35,802 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:09:35,803 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:09:35,803 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:09:35,804 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:09:35,804 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:09:35,805 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:09:35,806 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:09:35,806 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:09:35,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:09:35,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:09:35,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:09:35,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:09:35,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:09:35,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:09:35,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:09:35,813 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:09:35,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:09:35,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:09:35,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:09:35,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:09:35,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:09:35,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:09:35,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:09:35,817 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:09:35,817 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:09:35,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:09:35,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:09:35,819 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 13:09:35,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:09:35,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:09:35,829 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:09:35,829 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:09:35,829 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:09:35,829 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 13:09:35,830 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 13:09:35,830 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 13:09:35,830 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 13:09:35,830 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 13:09:35,830 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 13:09:35,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:09:35,830 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:09:35,830 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 13:09:35,830 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:09:35,831 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:09:35,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:09:35,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 13:09:35,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 13:09:35,831 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 13:09:35,831 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:09:35,831 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:09:35,831 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 13:09:35,831 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:09:35,832 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 13:09:35,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:09:35,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:09:35,832 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 13:09:35,832 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:09:35,832 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:09:35,832 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 13:09:35,833 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 13:09:35,833 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_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/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-28 13:09:35,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:09:35,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:09:35,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:09:35,864 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:09:35,864 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:09:35,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-28 13:09:35,900 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/bin-2019/uautomizer/data/b4b353026/aa1e26da6ff1414dace61f6c68cce7a7/FLAGac4e5d048 [2018-11-28 13:09:36,237 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:09:36,237 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-28 13:09:36,241 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/bin-2019/uautomizer/data/b4b353026/aa1e26da6ff1414dace61f6c68cce7a7/FLAGac4e5d048 [2018-11-28 13:09:36,664 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/bin-2019/uautomizer/data/b4b353026/aa1e26da6ff1414dace61f6c68cce7a7 [2018-11-28 13:09:36,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:09:36,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:09:36,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:36,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:09:36,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:09:36,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145e2c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36, skipping insertion in model container [2018-11-28 13:09:36,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:09:36,688 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:09:36,792 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:36,795 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:09:36,808 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:36,820 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:09:36,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36 WrapperNode [2018-11-28 13:09:36,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:36,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:36,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:09:36,821 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:09:36,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:36,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:09:36,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:09:36,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:09:36,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... [2018-11-28 13:09:36,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:09:36,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:09:36,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:09:36,908 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:09:36,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bc7c8724-b172-4541-b2ff-fbb6aff99d4d/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-28 13:09:36,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:09:36,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:09:36,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:09:36,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:09:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:09:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:09:37,110 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:09:37,110 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 13:09:37,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:37 BoogieIcfgContainer [2018-11-28 13:09:37,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:09:37,111 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 13:09:37,111 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 13:09:37,115 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 13:09:37,116 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:09:37,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 01:09:36" (1/3) ... [2018-11-28 13:09:37,117 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@517f6a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:09:37, skipping insertion in model container [2018-11-28 13:09:37,117 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:09:37,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:36" (2/3) ... [2018-11-28 13:09:37,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@517f6a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 01:09:37, skipping insertion in model container [2018-11-28 13:09:37,118 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 13:09:37,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:37" (3/3) ... [2018-11-28 13:09:37,120 INFO L375 chiAutomizerObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-28 13:09:37,177 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:09:37,178 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 13:09:37,178 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 13:09:37,178 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 13:09:37,179 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:09:37,179 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:09:37,179 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 13:09:37,179 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:09:37,179 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 13:09:37,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-28 13:09:37,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 13:09:37,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:37,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:37,222 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:09:37,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:09:37,223 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 13:09:37,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-28 13:09:37,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 13:09:37,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:37,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:37,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:09:37,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:09:37,230 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true 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-3true [2018-11-28 13:09:37,231 INFO L796 eck$LassoCheckResult]: Loop: 13#L14-3true 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; 16#L17-5true assume !true; 14#L17-6true call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 17#L14-2true main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 13#L14-3true [2018-11-28 13:09:37,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 13:09:37,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:37,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:37,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:37,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:37,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1256252, now seen corresponding path program 1 times [2018-11-28 13:09:37,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:37,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:37,351 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-28 13:09:37,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:37,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 13:09:37,355 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 13:09:37,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 13:09:37,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 13:09:37,367 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-28 13:09:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:37,372 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-28 13:09:37,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:09:37,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-28 13:09:37,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:09:37,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2018-11-28 13:09:37,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 13:09:37,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 13:09:37,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-28 13:09:37,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:09:37,380 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 13:09:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-28 13:09:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 13:09:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 13:09:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-28 13:09:37,399 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 13:09:37,399 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-28 13:09:37,399 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 13:09:37,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-28 13:09:37,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-28 13:09:37,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:37,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:37,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 13:09:37,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 13:09:37,400 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 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; 54#L14-3 [2018-11-28 13:09:37,400 INFO L796 eck$LassoCheckResult]: Loop: 54#L14-3 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; 51#L17-5 main_#t~short4 := main_~i~0 >= 0; 48#L17-1 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; 49#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 59#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 60#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 54#L14-3 [2018-11-28 13:09:37,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 13:09:37,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:37,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:37,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1188208494, now seen corresponding path program 1 times [2018-11-28 13:09:37,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:37,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:37,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash 268257712, now seen corresponding path program 1 times [2018-11-28 13:09:37,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:37,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:37,635 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2018-11-28 13:09:37,743 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:37,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:37,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:37,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:37,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:37,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:37,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:37,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:37,745 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration2_Lasso [2018-11-28 13:09:37,745 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:37,745 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:37,763 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-28 13:09:37,767 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-28 13:09:37,770 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-28 13:09:37,782 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-28 13:09:37,784 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-28 13:09:37,785 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-28 13:09:37,787 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-28 13:09:37,788 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-28 13:09:37,791 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-28 13:09:37,793 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-28 13:09:37,795 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-28 13:09:37,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-28 13:09:37,892 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-28 13:09:37,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-28 13:09:38,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:38,248 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:38,250 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-28 13:09:38,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,257 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-28 13:09:38,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:38,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,263 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-28 13:09:38,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,265 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-28 13:09:38,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:38,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,270 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-28 13:09:38,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,272 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-28 13:09:38,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:38,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:38,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,278 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-28 13:09:38,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:38,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:38,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,288 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-28 13:09:38,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:38,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:38,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:38,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,292 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-28 13:09:38,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:38,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:38,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:38,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:38,301 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-28 13:09:38,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:38,302 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:09:38,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:38,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:38,308 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:09:38,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:38,348 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:38,386 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 13:09:38,386 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 13:09:38,388 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:38,390 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:09:38,390 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:38,391 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-28 13:09:38,409 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 13:09:38,424 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:09:38,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:38,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:38,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:38,498 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-28 13:09:38,501 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-28 13:09:38,502 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 13:09:38,552 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 40 transitions. Complement of second has 6 states. [2018-11-28 13:09:38,552 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-28 13:09:38,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:09:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 13:09:38,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 13:09:38,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:38,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 13:09:38,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:38,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 13:09:38,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:38,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. [2018-11-28 13:09:38,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:09:38,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 31 transitions. [2018-11-28 13:09:38,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 13:09:38,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 13:09:38,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 31 transitions. [2018-11-28 13:09:38,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:38,560 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 13:09:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 31 transitions. [2018-11-28 13:09:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 13:09:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 13:09:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-11-28 13:09:38,562 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 13:09:38,562 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 13:09:38,562 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 13:09:38,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-11-28 13:09:38,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:09:38,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:38,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:38,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 13:09:38,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:09:38,563 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 157#L-1 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; 158#L14-3 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; 152#L17-5 [2018-11-28 13:09:38,563 INFO L796 eck$LassoCheckResult]: Loop: 152#L17-5 main_#t~short4 := main_~i~0 >= 0; 147#L17-1 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; 148#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 155#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; 151#L18-2 main_~i~0 := main_~i~0 - 1; 152#L17-5 [2018-11-28 13:09:38,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2018-11-28 13:09:38,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:38,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:38,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:38,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:38,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:38,580 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 1 times [2018-11-28 13:09:38,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:38,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:38,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:38,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:38,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:38,591 INFO L82 PathProgramCache]: Analyzing trace with hash 268259380, now seen corresponding path program 1 times [2018-11-28 13:09:38,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:38,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:38,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:38,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:38,827 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:38,827 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:38,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:38,827 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:38,827 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:38,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:38,827 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:38,828 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:38,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration3_Lasso [2018-11-28 13:09:38,828 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:38,828 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:38,830 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-28 13:09:38,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-28 13:09:38,836 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-28 13:09:38,837 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-28 13:09:38,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-28 13:09:38,840 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-28 13:09:38,918 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-28 13:09:38,919 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-28 13:09:38,921 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-28 13:09:38,923 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-28 13:09:38,924 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-28 13:09:38,926 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-28 13:09:38,928 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-28 13:09:38,930 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-28 13:09:39,059 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:39,059 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:39,060 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-28 13:09:39,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:39,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:39,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:39,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:39,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:39,062 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-28 13:09:39,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:39,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:39,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:39,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:39,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:39,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:39,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:39,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:39,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:39,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:39,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:39,067 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-28 13:09:39,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:39,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:39,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:39,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:39,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:39,069 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-28 13:09:39,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:39,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:39,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:39,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:39,072 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-28 13:09:39,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:39,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:39,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:39,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:39,078 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-28 13:09:39,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:39,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:39,081 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:39,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:39,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-28 13:09:39,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,087 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:09:39,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,088 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:09:39,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:39,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:39,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-28 13:09:39,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:39,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:39,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:39,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:39,095 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-28 13:09:39,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:39,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:39,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:39,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:39,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:39,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:39,110 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:39,133 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 13:09:39,133 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:09:39,134 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:39,136 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 13:09:39,136 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:39,136 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~j~0 - 1 >= 0] [2018-11-28 13:09:39,150 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 13:09:39,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:39,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:39,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:39,217 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-28 13:09:39,217 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 13:09:39,217 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-28 13:09:39,276 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 57 states and 77 transitions. Complement of second has 10 states. [2018-11-28 13:09:39,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 13:09:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:09:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 13:09:39,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-28 13:09:39,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:39,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 13:09:39,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:39,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-28 13:09:39,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:39,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 77 transitions. [2018-11-28 13:09:39,279 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-28 13:09:39,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 39 states and 51 transitions. [2018-11-28 13:09:39,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 13:09:39,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 13:09:39,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2018-11-28 13:09:39,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:39,280 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-11-28 13:09:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2018-11-28 13:09:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-11-28 13:09:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 13:09:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-11-28 13:09:39,282 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-11-28 13:09:39,282 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-11-28 13:09:39,282 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 13:09:39,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2018-11-28 13:09:39,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:09:39,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:39,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:39,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 13:09:39,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:09:39,284 INFO L794 eck$LassoCheckResult]: Stem: 311#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 306#L-1 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; 307#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 308#L14-4 main_~k~0 := 1; 309#L24-3 [2018-11-28 13:09:39,284 INFO L796 eck$LassoCheckResult]: Loop: 309#L24-3 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);__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; 310#L4 assume !(0 == __VERIFIER_assert_~cond); 318#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 316#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 309#L24-3 [2018-11-28 13:09:39,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,284 INFO L82 PathProgramCache]: Analyzing trace with hash 925734, now seen corresponding path program 1 times [2018-11-28 13:09:39,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:39,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:39,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:39,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 1 times [2018-11-28 13:09:39,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:39,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:39,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:39,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,303 INFO L82 PathProgramCache]: Analyzing trace with hash 237874543, now seen corresponding path program 1 times [2018-11-28 13:09:39,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:39,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:39,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:39,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:39,493 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-28 13:09:39,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:39,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:09:39,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:39,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:39,557 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-28 13:09:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:39,704 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2018-11-28 13:09:39,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:09:39,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 43 transitions. [2018-11-28 13:09:39,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:09:39,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 41 transitions. [2018-11-28 13:09:39,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 13:09:39,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 13:09:39,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-11-28 13:09:39,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:39,705 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 13:09:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-11-28 13:09:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-28 13:09:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 13:09:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2018-11-28 13:09:39,707 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-28 13:09:39,707 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2018-11-28 13:09:39,707 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 13:09:39,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2018-11-28 13:09:39,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:09:39,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:39,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:39,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:39,708 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:09:39,708 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 380#L-1 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; 381#L14-3 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; 386#L17-5 main_#t~short4 := main_~i~0 >= 0; 372#L17-1 assume !main_#t~short4; 373#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 388#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 389#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 387#L14-3 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; 375#L17-5 [2018-11-28 13:09:39,708 INFO L796 eck$LassoCheckResult]: Loop: 375#L17-5 main_#t~short4 := main_~i~0 >= 0; 370#L17-1 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; 371#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 378#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; 374#L18-2 main_~i~0 := main_~i~0 - 1; 375#L17-5 [2018-11-28 13:09:39,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash -272098468, now seen corresponding path program 1 times [2018-11-28 13:09:39,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:39,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:39,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:09:39,729 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 13:09:39,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,729 INFO L82 PathProgramCache]: Analyzing trace with hash 43044122, now seen corresponding path program 2 times [2018-11-28 13:09:39,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:39,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:39,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:39,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:39,792 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-28 13:09:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:39,833 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-11-28 13:09:39,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:09:39,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2018-11-28 13:09:39,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-28 13:09:39,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2018-11-28 13:09:39,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 13:09:39,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 13:09:39,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2018-11-28 13:09:39,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:39,835 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 71 transitions. [2018-11-28 13:09:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2018-11-28 13:09:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-11-28 13:09:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 13:09:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2018-11-28 13:09:39,837 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-28 13:09:39,837 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-28 13:09:39,838 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 13:09:39,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 47 transitions. [2018-11-28 13:09:39,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 13:09:39,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:39,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:39,839 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:39,839 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 13:09:39,839 INFO L794 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 473#L-1 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; 474#L14-3 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; 479#L17-5 main_#t~short4 := main_~i~0 >= 0; 494#L17-1 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; 491#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 483#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 484#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 480#L14-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 475#L14-4 main_~k~0 := 1; 476#L24-3 [2018-11-28 13:09:39,839 INFO L796 eck$LassoCheckResult]: Loop: 476#L24-3 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);__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; 477#L4 assume !(0 == __VERIFIER_assert_~cond); 487#L4-2 havoc main_#t~mem7;havoc main_#t~mem8; 485#L24-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 476#L24-3 [2018-11-28 13:09:39,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,839 INFO L82 PathProgramCache]: Analyzing trace with hash 97623763, now seen corresponding path program 1 times [2018-11-28 13:09:39,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:39,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:39,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2500554, now seen corresponding path program 2 times [2018-11-28 13:09:39,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:39,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1938296220, now seen corresponding path program 1 times [2018-11-28 13:09:39,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:39,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:39,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,074 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2018-11-28 13:09:40,157 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:40,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:40,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:40,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:40,158 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:40,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:40,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:40,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:40,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration6_Lasso [2018-11-28 13:09:40,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:40,158 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:40,160 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-28 13:09:40,164 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-28 13:09:40,167 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-28 13:09:40,168 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-28 13:09:40,170 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-28 13:09:40,171 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-28 13:09:40,173 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-28 13:09:40,174 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-28 13:09:40,178 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-28 13:09:40,179 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-28 13:09:40,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-28 13:09:40,293 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-28 13:09:40,294 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-28 13:09:40,297 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-28 13:09:40,488 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:40,488 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:40,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:40,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:40,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:40,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:40,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:40,491 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-28 13:09:40,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:40,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:40,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:40,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:40,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:40,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:40,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:40,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:40,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:40,494 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-28 13:09:40,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:40,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:40,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:40,497 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-28 13:09:40,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:40,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:40,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:40,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:40,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-28 13:09:40,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:40,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:40,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:40,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:40,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-28 13:09:40,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:40,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:40,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:40,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:40,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-28 13:09:40,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:40,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:40,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:40,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:40,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-28 13:09:40,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:40,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:40,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:40,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:40,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 13:09:40,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:40,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:40,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:40,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:40,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:40,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:40,525 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:40,550 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 13:09:40,550 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 13:09:40,551 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:40,552 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:09:40,552 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:40,552 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)_3, ULTIMATE.start_main_~#v~0.offset) = -4*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_3 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2018-11-28 13:09:40,581 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-28 13:09:40,582 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 13:09:40,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:40,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:40,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:40,617 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-28 13:09:40,618 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-28 13:09:40,618 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-11-28 13:09:40,627 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 47 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 39 states and 52 transitions. Complement of second has 4 states. [2018-11-28 13:09:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 13:09:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 13:09:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-28 13:09:40,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 13:09:40,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:40,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 13:09:40,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:40,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-28 13:09:40,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:40,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 52 transitions. [2018-11-28 13:09:40,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:09:40,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 30 states and 41 transitions. [2018-11-28 13:09:40,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 13:09:40,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 13:09:40,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions. [2018-11-28 13:09:40,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 13:09:40,631 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 13:09:40,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions. [2018-11-28 13:09:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-28 13:09:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 13:09:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2018-11-28 13:09:40,633 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 13:09:40,633 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-11-28 13:09:40,633 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 13:09:40,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 41 transitions. [2018-11-28 13:09:40,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 13:09:40,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 13:09:40,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 13:09:40,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 13:09:40,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 13:09:40,638 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 619#L-1 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; 620#L14-3 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; 632#L17-5 main_#t~short4 := main_~i~0 >= 0; 644#L17-1 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; 640#L17-3 assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 630#L17-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 631#L14-2 main_#t~post1 := main_~j~0;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; 633#L14-3 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; 634#L17-5 main_#t~short4 := main_~i~0 >= 0; 621#L17-1 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; 622#L17-3 [2018-11-28 13:09:40,638 INFO L796 eck$LassoCheckResult]: Loop: 622#L17-3 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3; 637#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; 625#L18-2 main_~i~0 := main_~i~0 - 1; 626#L17-5 main_#t~short4 := main_~i~0 >= 0; 639#L17-1 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; 622#L17-3 [2018-11-28 13:09:40,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:40,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1268629571, now seen corresponding path program 2 times [2018-11-28 13:09:40,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:40,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:40,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:40,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash 53536832, now seen corresponding path program 3 times [2018-11-28 13:09:40,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:40,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2116886020, now seen corresponding path program 1 times [2018-11-28 13:09:40,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:40,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:40,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:09:40,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:09:40,986 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-11-28 13:09:41,138 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-11-28 13:09:41,139 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 13:09:41,139 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 13:09:41,139 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 13:09:41,139 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 13:09:41,139 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 13:09:41,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 13:09:41,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 13:09:41,140 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 13:09:41,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: insertion_sort_false-unreach-call_true-termination.i_Iteration7_Lasso [2018-11-28 13:09:41,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 13:09:41,140 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 13:09:41,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-28 13:09:41,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-28 13:09:41,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-28 13:09:41,149 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-28 13:09:41,151 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-28 13:09:41,152 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-28 13:09:41,340 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-11-28 13:09:41,485 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-11-28 13:09:41,486 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-28 13:09:41,487 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-28 13:09:41,488 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-28 13:09:41,489 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-28 13:09:41,490 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-28 13:09:41,491 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-28 13:09:41,901 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-28 13:09:41,908 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 13:09:41,908 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 13:09:41,908 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-28 13:09:41,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:41,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:41,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:41,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:41,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:41,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:41,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:41,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:41,911 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-28 13:09:41,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:41,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:41,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:41,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:41,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:41,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:41,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:41,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:41,912 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-28 13:09:41,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:41,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:41,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:41,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:41,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:41,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:41,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:41,915 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-28 13:09:41,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:41,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:41,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:41,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:41,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:41,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:41,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:41,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:41,917 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-28 13:09:41,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:41,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 13:09:41,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:41,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:41,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:41,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 13:09:41,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 13:09:41,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:41,922 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-28 13:09:41,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:41,923 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 13:09:41,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:41,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:41,924 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 13:09:41,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:41,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:41,926 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-28 13:09:41,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:41,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:41,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:41,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:41,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:41,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:41,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 13:09:41,929 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-28 13:09:41,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 13:09:41,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 13:09:41,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 13:09:41,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 13:09:41,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 13:09:41,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 13:09:41,939 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 13:09:41,942 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 13:09:41,942 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 13:09:41,943 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 13:09:41,943 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 13:09:41,943 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 13:09:41,944 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 13:09:41,991 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2018-11-28 13:09:42,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:42,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:42,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:42,042 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-28 13:09:42,042 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-28 13:09:42,042 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 13:09:42,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 52 states and 69 transitions. Complement of second has 9 states. [2018-11-28 13:09:42,097 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-28 13:09:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:09:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-28 13:09:42,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 13:09:42,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:42,098 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:09:42,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:42,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:42,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:42,154 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-28 13:09:42,154 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-28 13:09:42,154 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 13:09:42,215 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 55 states and 72 transitions. Complement of second has 9 states. [2018-11-28 13:09:42,216 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-28 13:09:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:09:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-28 13:09:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 13:09:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:42,217 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 13:09:42,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:42,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:42,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:42,257 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-28 13:09:42,257 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-28 13:09:42,257 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-28 13:09:42,285 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 41 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 65 states and 93 transitions. Complement of second has 8 states. [2018-11-28 13:09:42,286 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-28 13:09:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 13:09:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-28 13:09:42,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-28 13:09:42,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:42,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-28 13:09:42,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:42,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-28 13:09:42,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 13:09:42,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 93 transitions. [2018-11-28 13:09:42,290 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:09:42,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2018-11-28 13:09:42,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 13:09:42,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 13:09:42,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 13:09:42,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 13:09:42,290 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:09:42,290 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:09:42,290 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:09:42,290 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 13:09:42,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:09:42,290 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 13:09:42,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 13:09:42,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 01:09:42 BoogieIcfgContainer [2018-11-28 13:09:42,295 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 13:09:42,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:09:42,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:09:42,295 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:09:42,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:37" (3/4) ... [2018-11-28 13:09:42,298 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:09:42,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:09:42,299 INFO L168 Benchmark]: Toolchain (without parser) took 5630.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.7 MB). Free memory was 958.7 MB in the beginning and 936.5 MB in the end (delta: 22.2 MB). Peak memory consumption was 362.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:42,299 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:09:42,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:42,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 945.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:42,300 INFO L168 Benchmark]: Boogie Preprocessor took 62.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:42,301 INFO L168 Benchmark]: RCFGBuilder took 203.12 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:42,301 INFO L168 Benchmark]: BuchiAutomizer took 5183.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 936.5 MB in the end (delta: 183.7 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:42,302 INFO L168 Benchmark]: Witness Printer took 3.20 ms. Allocated memory is still 1.4 GB. Free memory is still 936.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:09:42,305 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 945.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -195.8 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.12 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: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5183.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 196.1 MB). Free memory was 1.1 GB in the beginning and 936.5 MB in the end (delta: 183.7 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.20 ms. Allocated memory is still 1.4 GB. Free memory is still 936.5 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 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 2 * i + j and consists of 6 locations. One deterministic module has affine ranking function -4 * k + unknown-#length-unknown[v] + -1 * v and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 126 SDtfs, 173 SDslu, 86 SDs, 0 SdLazy, 201 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital223 mio100 ax100 hnf99 lsp85 ukn82 mio100 lsp68 div189 bol100 ite100 ukn100 eq148 hnf64 smp87 dnf183 smp78 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 89ms VariablesStem: 6 VariablesLoop: 10 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...