./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/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 b76149a90863628db6af524c153a3f434b0c2e82 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:41,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:41,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:41,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:41,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:41,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:41,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:41,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:41,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:41,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:41,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:41,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:41,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:41,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:41,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:41,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:41,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:41,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:41,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:41,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:41,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:41,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:41,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:41,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:41,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:41,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:41,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:41,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:41,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:41,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:41,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:41,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:41,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:41,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:41,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:41,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:41,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:41,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:41,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:41,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:41,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:41,731 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:59:41,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:41,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:41,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:41,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:41,746 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:41,747 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:41,747 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:41,747 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:41,747 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:41,747 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:41,747 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:41,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:41,757 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:41,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:41,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:41,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:41,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:41,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:41,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:41,758 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:41,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:41,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:41,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:41,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:41,759 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:41,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:41,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:41,759 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:41,760 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:41,760 INFO L138 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_5cf19835-e371-4130-8139-14a711668542/bin/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 -> b76149a90863628db6af524c153a3f434b0c2e82 [2019-10-22 08:59:41,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:41,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:41,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:41,811 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:41,811 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:41,812 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca.i [2019-10-22 08:59:41,859 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/data/1dae64d03/216d8dbd37ce412e9db9d6270e195ed5/FLAG84aea8add [2019-10-22 08:59:42,244 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:42,244 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/sv-benchmarks/c/termination-memory-alloca/b.03_assume-alloca.i [2019-10-22 08:59:42,253 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/data/1dae64d03/216d8dbd37ce412e9db9d6270e195ed5/FLAG84aea8add [2019-10-22 08:59:42,262 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/uautomizer/data/1dae64d03/216d8dbd37ce412e9db9d6270e195ed5 [2019-10-22 08:59:42,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:42,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:42,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:42,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:42,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:42,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dde477f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42, skipping insertion in model container [2019-10-22 08:59:42,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,277 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:42,304 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:42,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:42,620 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:42,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:42,683 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:42,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42 WrapperNode [2019-10-22 08:59:42,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:42,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:42,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:42,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:42,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:42,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:42,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:42,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:42,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... [2019-10-22 08:59:42,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:42,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:42,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:42,744 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:42,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cf19835-e371-4130-8139-14a711668542/bin/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 [2019-10-22 08:59:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:43,118 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:43,118 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:59:43,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:43 BoogieIcfgContainer [2019-10-22 08:59:43,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:43,120 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:43,120 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:43,124 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:43,125 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:43,125 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:42" (1/3) ... [2019-10-22 08:59:43,126 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21aa1912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:43, skipping insertion in model container [2019-10-22 08:59:43,126 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:43,126 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:42" (2/3) ... [2019-10-22 08:59:43,127 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21aa1912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:43, skipping insertion in model container [2019-10-22 08:59:43,127 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:43,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:43" (3/3) ... [2019-10-22 08:59:43,129 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.03_assume-alloca.i [2019-10-22 08:59:43,179 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:43,180 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:43,180 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:43,180 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:43,180 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:43,180 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:43,181 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:43,181 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:43,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:59:43,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:43,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:43,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:43,232 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:59:43,232 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:43,232 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:43,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:59:43,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:43,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:43,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:43,236 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:59:43,236 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:43,243 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 4#L553true assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 9#L556-5true [2019-10-22 08:59:43,247 INFO L793 eck$LassoCheckResult]: Loop: 9#L556-5true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 12#L556-1true assume !test_fun_#t~short10; 5#L556-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 7#L557true assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14;havoc test_fun_#t~mem13; 9#L556-5true [2019-10-22 08:59:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,254 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 08:59:43,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073346953] [2019-10-22 08:59:43,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,430 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:43,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1298091, now seen corresponding path program 1 times [2019-10-22 08:59:43,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140195075] [2019-10-22 08:59:43,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:43,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140195075] [2019-10-22 08:59:43,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:43,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:43,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402807224] [2019-10-22 08:59:43,499 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:59:43,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:43,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:43,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:43,513 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2019-10-22 08:59:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,535 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-10-22 08:59:43,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:43,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-10-22 08:59:43,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:43,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 7 transitions. [2019-10-22 08:59:43,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:59:43,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:59:43,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2019-10-22 08:59:43,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:43,545 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-10-22 08:59:43,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2019-10-22 08:59:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 08:59:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:59:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-10-22 08:59:43,569 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-10-22 08:59:43,569 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-10-22 08:59:43,569 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:43,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2019-10-22 08:59:43,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:59:43,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:43,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:43,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:59:43,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:43,570 INFO L791 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~ret18;test_fun_#in~x, test_fun_#in~y := main_#t~nondet16, main_#t~nondet17;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem8, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 35#L553 assume !(test_fun_#t~mem4 <= 0);havoc test_fun_#t~mem4; 36#L556-5 [2019-10-22 08:59:43,571 INFO L793 eck$LassoCheckResult]: Loop: 36#L556-5 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 40#L556-1 assume test_fun_#t~short10;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem9 <= 2147483647 - test_fun_#t~mem8; 37#L556-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 38#L557 assume !(test_fun_#t~mem11 <= 0);havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem14 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 + test_fun_#t~mem14, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14;havoc test_fun_#t~mem13; 36#L556-5 [2019-10-22 08:59:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,571 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-10-22 08:59:43,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574634331] [2019-10-22 08:59:43,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,603 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:43,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1296169, now seen corresponding path program 1 times [2019-10-22 08:59:43,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591887106] [2019-10-22 08:59:43,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,653 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:43,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905932, now seen corresponding path program 1 times [2019-10-22 08:59:43,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983490946] [2019-10-22 08:59:43,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,733 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:43,891 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-10-22 08:59:44,131 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-10-22 08:59:44,221 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:44,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:44,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:44,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:44,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:44,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:44,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:44,223 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:44,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.03_assume-alloca.i_Iteration2_Lasso [2019-10-22 08:59:44,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:44,223 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:44,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,484 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-10-22 08:59:44,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:44,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:45,016 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 08:59:45,141 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:45,148 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:45,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,154 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,156 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,161 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,163 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,164 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,164 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,167 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,168 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,171 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,171 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,171 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,172 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,174 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,174 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,175 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,182 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,182 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,182 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,186 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,188 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,188 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,188 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,192 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,193 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,195 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:45,196 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:45,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,205 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,206 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,206 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,206 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,207 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,209 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,209 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,209 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,210 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,210 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,211 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,212 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,213 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:45,216 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:45,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,237 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:45,238 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:45,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,242 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,242 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,243 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,253 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,253 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,253 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,253 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,253 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,254 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,254 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,256 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,257 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,257 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,257 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,260 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,265 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,265 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,268 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:45,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,268 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,268 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:45,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:45,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,270 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,271 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:45,271 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,271 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,281 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:45,289 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:45,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,346 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,347 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:45,351 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:45,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,378 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,379 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:45,379 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:45,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,394 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,395 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,396 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:45,396 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:45,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:45,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:59:45,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:45,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:45,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:45,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:45,409 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:45,409 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:45,463 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:45,511 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:45,512 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:45,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:45,517 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:45,517 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:45,518 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 2147483647 Supporting invariants [] [2019-10-22 08:59:45,554 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 08:59:45,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:59:45,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:45,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:45,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 08:59:45,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:45,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:45,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:45,726 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 [2019-10-22 08:59:45,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-10-22 08:59:45,784 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 11 states and 12 transitions. Complement of second has 8 states. [2019-10-22 08:59:45,784 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 [2019-10-22 08:59:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:59:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-10-22 08:59:45,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2019-10-22 08:59:45,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:45,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2019-10-22 08:59:45,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:45,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2019-10-22 08:59:45,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:45,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-10-22 08:59:45,789 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:45,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2019-10-22 08:59:45,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:45,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:45,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:45,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:45,790 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:45,790 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:45,790 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:45,790 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:45,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:45,790 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:45,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:45,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:45 BoogieIcfgContainer [2019-10-22 08:59:45,795 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:45,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:45,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:45,796 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:45,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:43" (3/4) ... [2019-10-22 08:59:45,800 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:45,800 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:45,802 INFO L168 Benchmark]: Toolchain (without parser) took 3536.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 257.9 MB). Free memory was 939.0 MB in the beginning and 1.2 GB in the end (delta: -277.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:45,802 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:45,803 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 939.0 MB in the beginning and 1.2 GB in the end (delta: -239.7 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:45,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:45,803 INFO L168 Benchmark]: Boogie Preprocessor took 21.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:45,804 INFO L168 Benchmark]: RCFGBuilder took 376.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:45,804 INFO L168 Benchmark]: BuchiAutomizer took 2675.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:45,805 INFO L168 Benchmark]: Witness Printer took 4.71 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:45,807 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 939.0 MB in the beginning and 1.2 GB in the end (delta: -239.7 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 376.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2675.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -67.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.71 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 17 SDtfs, 3 SDslu, 9 SDs, 0 SdLazy, 15 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax108 hnf100 lsp89 ukn69 mio100 lsp31 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf162 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 63ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...