./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/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 64bit --witnessprinter.graph.data.programhash 6ac1507c93933134ec25f982abf479335179fe0d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 11:15:28,897 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:15:28,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:15:28,904 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:15:28,904 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:15:28,905 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:15:28,905 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:15:28,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:15:28,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:15:28,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:15:28,908 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:15:28,908 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:15:28,909 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:15:28,909 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:15:28,910 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:15:28,910 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:15:28,911 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:15:28,912 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:15:28,912 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:15:28,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:15:28,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:15:28,914 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:15:28,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:15:28,916 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:15:28,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:15:28,916 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:15:28,917 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:15:28,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:15:28,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:15:28,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:15:28,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:15:28,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:15:28,919 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:15:28,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:15:28,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:15:28,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:15:28,920 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 11:15:28,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:15:28,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:15:28,929 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 11:15:28,929 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 11:15:28,929 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 11:15:28,929 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 11:15:28,929 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 11:15:28,929 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 11:15:28,929 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 11:15:28,929 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 11:15:28,929 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 11:15:28,929 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 11:15:28,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 11:15:28,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:15:28,931 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:15:28,931 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 11:15:28,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:15:28,931 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 11:15:28,931 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 11:15:28,931 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 11:15:28,932 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_d2941478-6314-45d9-a1fb-a86603705cbb/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6ac1507c93933134ec25f982abf479335179fe0d [2018-12-09 11:15:28,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:15:28,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:15:28,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:15:28,963 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:15:28,963 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:15:28,964 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-12-09 11:15:29,012 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/data/ea12aabad/d1c271845fa4473b98f1b889518c8b5f/FLAG70ab6f492 [2018-12-09 11:15:29,369 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:15:29,369 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/sv-benchmarks/c/termination-recursive-malloc/selectionSort_recursive_true-termination.c.i [2018-12-09 11:15:29,373 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/data/ea12aabad/d1c271845fa4473b98f1b889518c8b5f/FLAG70ab6f492 [2018-12-09 11:15:29,381 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/data/ea12aabad/d1c271845fa4473b98f1b889518c8b5f [2018-12-09 11:15:29,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:15:29,383 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:15:29,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:15:29,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:15:29,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:15:29,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374725de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29, skipping insertion in model container [2018-12-09 11:15:29,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:15:29,401 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:15:29,484 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:15:29,490 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:15:29,500 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:15:29,509 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:15:29,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29 WrapperNode [2018-12-09 11:15:29,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:15:29,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:15:29,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:15:29,510 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:15:29,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:15:29,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:15:29,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:15:29,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:15:29,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... [2018-12-09 11:15:29,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:15:29,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:15:29,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:15:29,578 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:15:29,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/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-12-09 11:15:29,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:15:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:15:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:15:29,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:15:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 11:15:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure selectionSort [2018-12-09 11:15:29,613 INFO L138 BoogieDeclarations]: Found implementation of procedure selectionSort [2018-12-09 11:15:29,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:15:29,752 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:15:29,752 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 11:15:29,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:15:29 BoogieIcfgContainer [2018-12-09 11:15:29,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:15:29,753 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 11:15:29,753 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 11:15:29,755 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 11:15:29,756 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:15:29,756 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 11:15:29" (1/3) ... [2018-12-09 11:15:29,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@796e8bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 11:15:29, skipping insertion in model container [2018-12-09 11:15:29,757 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:15:29,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:15:29" (2/3) ... [2018-12-09 11:15:29,757 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@796e8bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 11:15:29, skipping insertion in model container [2018-12-09 11:15:29,757 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 11:15:29,757 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:15:29" (3/3) ... [2018-12-09 11:15:29,758 INFO L375 chiAutomizerObserver]: Analyzing ICFG selectionSort_recursive_true-termination.c.i [2018-12-09 11:15:29,791 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 11:15:29,791 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 11:15:29,791 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 11:15:29,791 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 11:15:29,791 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:15:29,791 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:15:29,792 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 11:15:29,792 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:15:29,792 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 11:15:29,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-09 11:15:29,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-09 11:15:29,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:15:29,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:15:29,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 11:15:29,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:15:29,823 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 11:15:29,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-09 11:15:29,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-12-09 11:15:29,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:15:29,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:15:29,825 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-09 11:15:29,825 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-09 11:15:29,830 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 9#L31true assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 16#L36-3true [2018-12-09 11:15:29,830 INFO L796 eck$LassoCheckResult]: Loop: 16#L36-3true assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 20#L36-2true main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 16#L36-3true [2018-12-09 11:15:29,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:29,834 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-09 11:15:29,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:29,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:29,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:29,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:29,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:29,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2018-12-09 11:15:29,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:29,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:29,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:29,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:29,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:29,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2018-12-09 11:15:29,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:29,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:29,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:29,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:29,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:30,034 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 11:15:30,036 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 11:15:30,036 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 11:15:30,036 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 11:15:30,036 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 11:15:30,036 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:15:30,036 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 11:15:30,036 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 11:15:30,036 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration1_Lasso [2018-12-09 11:15:30,037 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 11:15:30,037 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 11:15:30,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:30,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:30,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:30,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:30,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:30,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:30,234 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 11:15:30,237 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 11:15:30,238 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-12-09 11:15:30,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:30,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:30,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:30,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:30,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:30,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:30,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:30,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:30,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:30,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:30,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:30,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:30,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:30,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:30,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:30,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:30,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:30,247 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-12-09 11:15:30,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:30,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:30,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:30,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:30,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:30,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:30,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:30,255 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-12-09 11:15:30,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:30,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:30,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:30,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:30,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:30,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:30,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:30,274 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-12-09 11:15:30,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:30,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:30,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:30,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:30,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:30,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:30,324 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 11:15:30,348 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 11:15:30,348 INFO L444 ModelExtractionUtils]: 13 out of 22 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-09 11:15:30,350 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 11:15:30,351 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 11:15:30,352 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 11:15:30,352 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-09 11:15:30,369 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 11:15:30,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:30,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:30,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:15:30,431 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-12-09 11:15:30,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2018-12-09 11:15:30,465 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 39 states and 53 transitions. Complement of second has 9 states. [2018-12-09 11:15:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 11:15:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 11:15:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-12-09 11:15:30,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-09 11:15:30,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:30,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-09 11:15:30,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:30,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-09 11:15:30,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:30,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 53 transitions. [2018-12-09 11:15:30,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 11:15:30,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 14 states and 19 transitions. [2018-12-09 11:15:30,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 11:15:30,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-12-09 11:15:30,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2018-12-09 11:15:30,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:15:30,478 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-09 11:15:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2018-12-09 11:15:30,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-09 11:15:30,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 11:15:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-12-09 11:15:30,494 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-09 11:15:30,494 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-12-09 11:15:30,494 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 11:15:30,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-12-09 11:15:30,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-09 11:15:30,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:15:30,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:15:30,495 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 11:15:30,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-09 11:15:30,495 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 122#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 120#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 121#L36-3 assume !(main_~i~0 < main_~n~0); 115#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 118#selectionSortENTRY [2018-12-09 11:15:30,495 INFO L796 eck$LassoCheckResult]: Loop: 118#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 119#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 123#L14-3 assume !(~index~0 < ~size); 124#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 116#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 118#selectionSortENTRY [2018-12-09 11:15:30,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 1 times [2018-12-09 11:15:30,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:30,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:30,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:30,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:15:30,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:15:30,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:15:30,523 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 11:15:30,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash 53570596, now seen corresponding path program 1 times [2018-12-09 11:15:30,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:30,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:30,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:30,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:15:30,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:15:30,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:15:30,533 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 11:15:30,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:15:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:15:30,535 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-12-09 11:15:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:15:30,544 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-09 11:15:30,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:15:30,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-12-09 11:15:30,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 11:15:30,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2018-12-09 11:15:30,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 11:15:30,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 11:15:30,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-12-09 11:15:30,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:15:30,546 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-09 11:15:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-12-09 11:15:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-09 11:15:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 11:15:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-12-09 11:15:30,548 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-09 11:15:30,548 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-12-09 11:15:30,548 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 11:15:30,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-12-09 11:15:30,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 11:15:30,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:15:30,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:15:30,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 11:15:30,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:15:30,550 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 156#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 157#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 158#L36-3 assume !(main_~i~0 < main_~n~0); 152#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 154#selectionSortENTRY [2018-12-09 11:15:30,550 INFO L796 eck$LassoCheckResult]: Loop: 154#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 155#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 159#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 150#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 153#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 162#L14-3 assume !(~index~0 < ~size); 160#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 151#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 154#selectionSortENTRY [2018-12-09 11:15:30,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:30,550 INFO L82 PathProgramCache]: Analyzing trace with hash 28695915, now seen corresponding path program 2 times [2018-12-09 11:15:30,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:30,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:30,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:30,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:30,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:15:30,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:15:30,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:15:30,561 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 11:15:30,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:30,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 1 times [2018-12-09 11:15:30,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:30,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:30,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:15:30,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:30,694 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-12-09 11:15:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:15:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:15:30,785 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 11:15:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:15:30,792 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-09 11:15:30,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:15:30,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2018-12-09 11:15:30,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 11:15:30,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2018-12-09 11:15:30,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 11:15:30,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 11:15:30,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-12-09 11:15:30,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:15:30,794 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-09 11:15:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-12-09 11:15:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-09 11:15:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-09 11:15:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-12-09 11:15:30,795 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-09 11:15:30,795 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-12-09 11:15:30,795 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 11:15:30,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-12-09 11:15:30,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 11:15:30,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:15:30,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:15:30,796 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:15:30,796 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:15:30,796 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 194#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 195#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 200#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 201#L36-3 assume !(main_~i~0 < main_~n~0); 188#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 191#selectionSortENTRY [2018-12-09 11:15:30,796 INFO L796 eck$LassoCheckResult]: Loop: 191#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 192#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 196#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 187#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 190#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 199#L14-3 assume !(~index~0 < ~size); 197#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 189#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 191#selectionSortENTRY [2018-12-09 11:15:30,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996941, now seen corresponding path program 1 times [2018-12-09 11:15:30,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:30,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:30,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:30,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:30,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 2 times [2018-12-09 11:15:30,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:30,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:30,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:30,822 INFO L82 PathProgramCache]: Analyzing trace with hash 170190416, now seen corresponding path program 1 times [2018-12-09 11:15:30,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:30,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:30,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:15:30,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:30,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:15:30,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:15:30,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:15:30,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:30,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:15:30,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:15:30,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-12-09 11:15:31,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:15:31,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:15:31,138 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-12-09 11:15:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:15:31,175 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-09 11:15:31,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:15:31,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-12-09 11:15:31,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 11:15:31,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 21 transitions. [2018-12-09 11:15:31,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 11:15:31,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-09 11:15:31,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-12-09 11:15:31,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:15:31,177 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-09 11:15:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-12-09 11:15:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-09 11:15:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 11:15:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-12-09 11:15:31,179 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 11:15:31,179 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 11:15:31,179 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 11:15:31,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-12-09 11:15:31,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 11:15:31,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:15:31,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:15:31,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-09 11:15:31,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:15:31,181 INFO L794 eck$LassoCheckResult]: Stem: 295#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 290#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 291#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 292#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 297#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 298#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 299#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 300#L36-3 assume !(main_~i~0 < main_~n~0); 285#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 288#selectionSortENTRY [2018-12-09 11:15:31,181 INFO L796 eck$LassoCheckResult]: Loop: 288#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 289#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 293#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 284#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 287#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 296#L14-3 assume !(~index~0 < ~size); 294#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 286#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 288#selectionSortENTRY [2018-12-09 11:15:31,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:31,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1357299119, now seen corresponding path program 2 times [2018-12-09 11:15:31,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:31,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:31,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:31,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:31,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:31,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1756570492, now seen corresponding path program 3 times [2018-12-09 11:15:31,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:31,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:31,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:15:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:31,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash -290845646, now seen corresponding path program 2 times [2018-12-09 11:15:31,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:31,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:31,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:15:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:31,366 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2018-12-09 11:15:31,662 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 11:15:31,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 11:15:31,663 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 11:15:31,663 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 11:15:31,663 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 11:15:31,663 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:15:31,663 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 11:15:31,663 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 11:15:31,663 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration5_Lasso [2018-12-09 11:15:31,663 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 11:15:31,663 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 11:15:31,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:31,866 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 11:15:31,866 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 11:15:31,866 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-12-09 11:15:31,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,868 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-12-09 11:15:31,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:31,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:31,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,871 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-12-09 11:15:31,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,873 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-12-09 11:15:31,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,875 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-12-09 11:15:31,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,877 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-12-09 11:15:31,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,878 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-12-09 11:15:31,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:31,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,882 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-12-09 11:15:31,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:31,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,885 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-12-09 11:15:31,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:31,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,889 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-12-09 11:15:31,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,890 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-12-09 11:15:31,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,892 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-12-09 11:15:31,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,894 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-12-09 11:15:31,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:31,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:31,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,897 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-12-09 11:15:31,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:31,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:31,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:31,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:31,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,900 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-12-09 11:15:31,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:31,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:31,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:31,909 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-12-09 11:15:31,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:31,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:31,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:31,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:31,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:31,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:31,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 11:15:31,944 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 11:15:31,944 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-12-09 11:15:31,945 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 11:15:31,945 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 11:15:31,946 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 11:15:31,946 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_#in~startIndex, v_rep(select #length selectionSort_#in~array.base)_1, selectionSort_#in~array.offset) = -4*selectionSort_#in~startIndex + 1*v_rep(select #length selectionSort_#in~array.base)_1 - 1*selectionSort_#in~array.offset Supporting invariants [] [2018-12-09 11:15:31,952 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-09 11:15:31,954 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 11:15:31,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:31,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:31,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:32,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:15:32,038 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-09 11:15:32,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-09 11:15:32,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 39 states and 48 transitions. Complement of second has 15 states. [2018-12-09 11:15:32,120 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-12-09 11:15:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 11:15:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-09 11:15:32,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 8 letters. [2018-12-09 11:15:32,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:32,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 17 letters. Loop has 8 letters. [2018-12-09 11:15:32,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:32,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 9 letters. Loop has 16 letters. [2018-12-09 11:15:32,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:32,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-12-09 11:15:32,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-09 11:15:32,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 35 states and 44 transitions. [2018-12-09 11:15:32,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 11:15:32,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 11:15:32,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-12-09 11:15:32,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 11:15:32,124 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-12-09 11:15:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-12-09 11:15:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-12-09 11:15:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 11:15:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2018-12-09 11:15:32,126 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-09 11:15:32,126 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2018-12-09 11:15:32,126 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 11:15:32,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2018-12-09 11:15:32,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 11:15:32,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:15:32,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:15:32,127 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:15:32,127 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 11:15:32,127 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 447#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 448#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 449#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 455#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 456#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 457#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 458#L36-3 assume !(main_~i~0 < main_~n~0); 438#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 443#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 445#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 450#L14-3 [2018-12-09 11:15:32,127 INFO L796 eck$LassoCheckResult]: Loop: 450#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 437#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 439#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 450#L14-3 [2018-12-09 11:15:32,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:32,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1305603789, now seen corresponding path program 1 times [2018-12-09 11:15:32,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:32,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:32,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:15:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:32,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 1 times [2018-12-09 11:15:32,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:32,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:32,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:32,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:32,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:32,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash -18607689, now seen corresponding path program 1 times [2018-12-09 11:15:32,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:32,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:32,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:32,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:32,442 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 11:15:32,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 11:15:32,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 11:15:32,443 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 11:15:32,443 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 11:15:32,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:15:32,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 11:15:32,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 11:15:32,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration6_Lasso [2018-12-09 11:15:32,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 11:15:32,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 11:15:32,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:32,736 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 11:15:32,736 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 11:15:32,736 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-12-09 11:15:32,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,738 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-12-09 11:15:32,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,740 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-12-09 11:15:32,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,741 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-12-09 11:15:32,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,742 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:32,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:32,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,743 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-12-09 11:15:32,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,744 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-12-09 11:15:32,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,745 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-12-09 11:15:32,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,747 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-12-09 11:15:32,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:32,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:32,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,750 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-12-09 11:15:32,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,751 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-12-09 11:15:32,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,752 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-12-09 11:15:32,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,754 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-12-09 11:15:32,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,755 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-12-09 11:15:32,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,756 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-12-09 11:15:32,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:32,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:32,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:32,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:32,759 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-12-09 11:15:32,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:32,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:32,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:32,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:32,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:32,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:32,779 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 11:15:32,796 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 11:15:32,797 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-09 11:15:32,797 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 11:15:32,798 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 11:15:32,798 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 11:15:32,798 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~array.offset, v_rep(select #length selectionSort_~array.base)_1) = -4*selectionSort_~index~0 - 1*selectionSort_~array.offset + 1*v_rep(select #length selectionSort_~array.base)_1 Supporting invariants [] [2018-12-09 11:15:32,806 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-09 11:15:32,808 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 11:15:32,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:32,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:32,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:15:32,853 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-12-09 11:15:32,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 11:15:32,867 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 53 transitions. Complement of second has 8 states. [2018-12-09 11:15:32,867 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-12-09 11:15:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 11:15:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-09 11:15:32,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-09 11:15:32,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:32,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-09 11:15:32,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:32,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2018-12-09 11:15:32,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:32,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2018-12-09 11:15:32,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 11:15:32,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 36 transitions. [2018-12-09 11:15:32,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 11:15:32,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 11:15:32,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2018-12-09 11:15:32,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 11:15:32,882 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-12-09 11:15:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2018-12-09 11:15:32,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-12-09 11:15:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 11:15:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-09 11:15:32,883 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 11:15:32,884 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 11:15:32,884 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 11:15:32,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-12-09 11:15:32,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 11:15:32,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:15:32,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:15:32,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:15:32,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 11:15:32,885 INFO L794 eck$LassoCheckResult]: Stem: 598#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 592#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 593#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 594#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 600#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 601#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 602#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 603#L36-3 assume !(main_~i~0 < main_~n~0); 586#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 588#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 589#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 596#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 585#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 587#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 599#L14-3 assume !(~index~0 < ~size); 597#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 583#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 590#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 591#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 595#L14-3 [2018-12-09 11:15:32,885 INFO L796 eck$LassoCheckResult]: Loop: 595#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 582#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 584#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 595#L14-3 [2018-12-09 11:15:32,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1445216632, now seen corresponding path program 1 times [2018-12-09 11:15:32,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:32,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:32,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:32,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:32,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:32,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 11:15:32,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 11:15:32,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d2941478-6314-45d9-a1fb-a86603705cbb/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 11:15:32,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:32,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 11:15:33,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 11:15:33,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-12-09 11:15:33,011 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 11:15:33,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:33,012 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 2 times [2018-12-09 11:15:33,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:33,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:33,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:33,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:15:33,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:33,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 11:15:33,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:15:33,044 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 15 states. [2018-12-09 11:15:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:15:33,162 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-12-09 11:15:33,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 11:15:33,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 64 transitions. [2018-12-09 11:15:33,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 11:15:33,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 45 transitions. [2018-12-09 11:15:33,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 11:15:33,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 11:15:33,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-12-09 11:15:33,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 11:15:33,163 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-12-09 11:15:33,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-12-09 11:15:33,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-09 11:15:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-09 11:15:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2018-12-09 11:15:33,165 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-09 11:15:33,165 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2018-12-09 11:15:33,165 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 11:15:33,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2018-12-09 11:15:33,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 11:15:33,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 11:15:33,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 11:15:33,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:15:33,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 11:15:33,167 INFO L794 eck$LassoCheckResult]: Stem: 760#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 753#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet9, main_#t~post8, main_~i~0, main_~n~0, main_~a~0.base, main_~a~0.offset;main_~n~0 := main_#t~nondet6;havoc main_#t~nondet6; 754#L31 assume !(main_~n~0 < 1);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4 * main_~n~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;main_~i~0 := 0; 755#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 762#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 769#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 765#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 763#L36-3 assume !!(main_~i~0 < main_~n~0);call write~int(main_#t~nondet9, main_~a~0.base, main_~a~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet9; 764#L36-2 main_#t~post8 := main_~i~0;main_~i~0 := 1 + main_#t~post8;havoc main_#t~post8; 766#L36-3 assume !(main_~i~0 < main_~n~0); 747#L36-4 call selectionSort(main_~a~0.base, main_~a~0.offset, 0, main_~n~0);< 749#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 750#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 758#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 768#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 761#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 757#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 746#L16 assume !(#t~mem2 < #t~mem3);havoc #t~mem3;havoc #t~mem2; 748#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 767#L14-3 assume !(~index~0 < ~size); 759#L14-4 call #t~mem4 := read~int(~array.base, ~array.offset + 4 * ~startIndex, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4);call write~int(#t~mem5, ~array.base, ~array.offset + 4 * ~startIndex, 4);havoc #t~mem5;call write~int(~temp~0, ~array.base, ~array.offset + 4 * ~minIndex~0, 4); 744#L22 call selectionSort(~array.base, ~array.offset, 1 + ~startIndex, ~size);< 751#selectionSortENTRY ~array.base, ~array.offset := #in~array.base, #in~array.offset;~startIndex := #in~startIndex;~size := #in~size; 752#L11 assume !(~startIndex >= ~size - 1);~minIndex~0 := ~startIndex;~index~0 := 1 + ~startIndex; 756#L14-3 [2018-12-09 11:15:33,167 INFO L796 eck$LassoCheckResult]: Loop: 756#L14-3 assume !!(~index~0 < ~size);call #t~mem2 := read~int(~array.base, ~array.offset + 4 * ~index~0, 4);call #t~mem3 := read~int(~array.base, ~array.offset + 4 * ~minIndex~0, 4); 743#L16 assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~minIndex~0 := ~index~0; 745#L14-2 #t~post1 := ~index~0;~index~0 := 1 + #t~post1;havoc #t~post1; 756#L14-3 [2018-12-09 11:15:33,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:33,167 INFO L82 PathProgramCache]: Analyzing trace with hash 349648920, now seen corresponding path program 2 times [2018-12-09 11:15:33,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:33,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:33,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:15:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:33,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:33,183 INFO L82 PathProgramCache]: Analyzing trace with hash 67625, now seen corresponding path program 3 times [2018-12-09 11:15:33,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:33,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:33,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:33,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:15:33,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:33,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1095320754, now seen corresponding path program 1 times [2018-12-09 11:15:33,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 11:15:33,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 11:15:33,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:33,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:15:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:15:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:15:33,367 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-12-09 11:15:33,672 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-12-09 11:15:33,893 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2018-12-09 11:15:33,932 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 11:15:33,932 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 11:15:33,932 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 11:15:33,932 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 11:15:33,932 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 11:15:33,932 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 11:15:33,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 11:15:33,932 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 11:15:33,932 INFO L131 ssoRankerPreferences]: Filename of dumped script: selectionSort_recursive_true-termination.c.i_Iteration8_Lasso [2018-12-09 11:15:33,932 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 11:15:33,932 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 11:15:33,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:33,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:34,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:34,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:34,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 11:15:34,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 11:15:34,210 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 11:15:34,210 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-12-09 11:15:34,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:34,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:34,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,212 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-12-09 11:15:34,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:34,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:34,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,215 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-12-09 11:15:34,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,216 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-12-09 11:15:34,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,217 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-12-09 11:15:34,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,217 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-12-09 11:15:34,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,218 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-12-09 11:15:34,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,219 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-12-09 11:15:34,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:34,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:34,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:34,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,221 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-12-09 11:15:34,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,222 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-12-09 11:15:34,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,223 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-12-09 11:15:34,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,224 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-12-09 11:15:34,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:34,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,226 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-12-09 11:15:34,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,227 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-12-09 11:15:34,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,228 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-12-09 11:15:34,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,228 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 11:15:34,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,229 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 11:15:34,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:34,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,230 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-12-09 11:15:34,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:34,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:34,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:34,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,234 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-12-09 11:15:34,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:34,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:34,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,235 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-12-09 11:15:34,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 11:15:34,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 11:15:34,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 11:15:34,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 11:15:34,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 11:15:34,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 11:15:34,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 11:15:34,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 11:15:34,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 11:15:34,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 11:15:34,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 11:15:34,253 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 11:15:34,265 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-09 11:15:34,265 INFO L444 ModelExtractionUtils]: 24 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-09 11:15:34,265 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 11:15:34,266 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 11:15:34,266 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 11:15:34,266 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(selectionSort_~index~0, selectionSort_~array.offset, v_rep(select #length selectionSort_~array.base)_2) = -4*selectionSort_~index~0 - 1*selectionSort_~array.offset + 1*v_rep(select #length selectionSort_~array.base)_2 Supporting invariants [] [2018-12-09 11:15:34,280 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2018-12-09 11:15:34,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 11:15:34,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:34,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:34,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:15:34,328 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-12-09 11:15:34,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 11:15:34,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-12-09 11:15:34,341 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-12-09 11:15:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 11:15:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-09 11:15:34,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-12-09 11:15:34,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:34,342 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 11:15:34,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:34,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:34,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:15:34,380 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 11:15:34,380 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 11:15:34,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-12-09 11:15:34,390 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-12-09 11:15:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 11:15:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-09 11:15:34,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 24 letters. Loop has 3 letters. [2018-12-09 11:15:34,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:34,391 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 11:15:34,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:15:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:34,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:15:34,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 11:15:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:15:34,439 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-09 11:15:34,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-09 11:15:34,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 33 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2018-12-09 11:15:34,462 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-12-09 11:15:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 11:15:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-12-09 11:15:34,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 3 letters. [2018-12-09 11:15:34,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:34,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 27 letters. Loop has 3 letters. [2018-12-09 11:15:34,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:34,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 24 letters. Loop has 6 letters. [2018-12-09 11:15:34,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 11:15:34,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2018-12-09 11:15:34,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 11:15:34,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2018-12-09 11:15:34,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 11:15:34,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 11:15:34,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 11:15:34,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 11:15:34,464 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:15:34,464 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:15:34,464 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 11:15:34,464 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 11:15:34,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 11:15:34,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 11:15:34,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 11:15:34,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 11:15:34 BoogieIcfgContainer [2018-12-09 11:15:34,468 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 11:15:34,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:15:34,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:15:34,469 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:15:34,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:15:29" (3/4) ... [2018-12-09 11:15:34,471 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 11:15:34,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:15:34,472 INFO L168 Benchmark]: Toolchain (without parser) took 5088.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.8 MB). Free memory was 953.3 MB in the beginning and 1.3 GB in the end (delta: -359.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:15:34,472 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:15:34,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.49 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:15:34,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.36 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 11:15:34,473 INFO L168 Benchmark]: Boogie Preprocessor took 46.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-09 11:15:34,473 INFO L168 Benchmark]: RCFGBuilder took 175.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-12-09 11:15:34,473 INFO L168 Benchmark]: BuchiAutomizer took 4715.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:15:34,474 INFO L168 Benchmark]: Witness Printer took 2.60 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:15:34,476 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 125.49 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.36 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 175.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4715.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -194.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.60 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -4 * \old(startIndex) + unknown-#length-unknown[array] + -1 * array and consists of 5 locations. One deterministic module has affine ranking function -4 * index + -1 * array + unknown-#length-unknown[array] and consists of 4 locations. One nondeterministic module has affine ranking function -4 * index + -1 * array + unknown-#length-unknown[array] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 3.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 112 SDtfs, 139 SDslu, 116 SDs, 0 SdLazy, 265 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI1 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital171 mio100 ax100 hnf99 lsp96 ukn69 mio100 lsp66 div100 bol100 ite100 ukn100 eq161 hnf89 smp95 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 2ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...