./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/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 df4500f5696d99ca846c8b1d02ff521622ca4836 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:41:47,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:41:47,757 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:41:47,764 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:41:47,764 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:41:47,765 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:41:47,766 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:41:47,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:41:47,767 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:41:47,768 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:41:47,769 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:41:47,769 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:41:47,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:41:47,770 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:41:47,771 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:41:47,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:41:47,773 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:41:47,774 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:41:47,775 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:41:47,776 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:41:47,777 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:41:47,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:41:47,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:41:47,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:41:47,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:41:47,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:41:47,781 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:41:47,781 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:41:47,782 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:41:47,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:41:47,783 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:41:47,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:41:47,783 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:41:47,783 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:41:47,784 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:41:47,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:41:47,784 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 05:41:47,792 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:41:47,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:41:47,793 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:41:47,793 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:41:47,793 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:41:47,794 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:41:47,794 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:41:47,794 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:41:47,794 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:41:47,794 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:41:47,794 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:41:47,794 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:41:47,794 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:41:47,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:41:47,795 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:41:47,795 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:41:47,795 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:41:47,795 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:41:47,795 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:41:47,795 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:41:47,795 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:41:47,796 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:41:47,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:41:47,796 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:41:47,796 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:41:47,796 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:41:47,796 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:41:47,796 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:41:47,797 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:41:47,797 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_ff330e5c-d5fd-44b4-bcff-6317051b2548/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 -> df4500f5696d99ca846c8b1d02ff521622ca4836 [2018-11-23 05:41:47,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:41:47,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:41:47,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:41:47,836 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:41:47,837 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:41:47,837 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-23 05:41:47,880 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/data/8a1bdfef9/2f9474f98dca4a459d180874d7a61dc1/FLAGfabb933c4 [2018-11-23 05:41:48,330 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:41:48,331 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-23 05:41:48,342 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/data/8a1bdfef9/2f9474f98dca4a459d180874d7a61dc1/FLAGfabb933c4 [2018-11-23 05:41:48,357 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/data/8a1bdfef9/2f9474f98dca4a459d180874d7a61dc1 [2018-11-23 05:41:48,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:41:48,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:41:48,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:41:48,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:41:48,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:41:48,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a78139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48, skipping insertion in model container [2018-11-23 05:41:48,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:41:48,398 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:41:48,583 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:41:48,592 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:41:48,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:41:48,688 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:41:48,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48 WrapperNode [2018-11-23 05:41:48,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:41:48,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:41:48,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:41:48,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:41:48,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:41:48,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:41:48,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:41:48,719 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:41:48,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... [2018-11-23 05:41:48,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:41:48,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:41:48,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:41:48,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:41:48,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ff330e5c-d5fd-44b4-bcff-6317051b2548/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:41:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:41:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:41:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:41:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:41:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:41:48,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:41:48,943 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:41:48,944 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 05:41:48,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:41:48 BoogieIcfgContainer [2018-11-23 05:41:48,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:41:48,945 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:41:48,945 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:41:48,947 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:41:48,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:41:48,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:41:48" (1/3) ... [2018-11-23 05:41:48,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d6e6414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:41:48, skipping insertion in model container [2018-11-23 05:41:48,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:41:48,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:41:48" (2/3) ... [2018-11-23 05:41:48,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@d6e6414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:41:48, skipping insertion in model container [2018-11-23 05:41:48,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:41:48,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:41:48" (3/3) ... [2018-11-23 05:41:48,951 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-23 05:41:48,987 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:41:48,987 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:41:48,987 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:41:48,988 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:41:48,988 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:41:48,988 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:41:48,988 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:41:48,988 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:41:48,988 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:41:48,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 05:41:49,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 05:41:49,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:41:49,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:41:49,018 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 05:41:49,018 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 05:41:49,018 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:41:49,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-23 05:41:49,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 05:41:49,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:41:49,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:41:49,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 05:41:49,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 05:41:49,024 INFO L794 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~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 11#L555true assume !(test_fun_#t~mem5 <= 0);havoc test_fun_#t~mem5; 5#L558-5true [2018-11-23 05:41:49,024 INFO L796 eck$LassoCheckResult]: Loop: 5#L558-5true call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; 8#L558-1true assume !test_fun_#t~short11; 12#L558-3true assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 14#L559true assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 5#L558-5true [2018-11-23 05:41:49,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:41:49,028 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 05:41:49,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:41:49,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:41:49,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:41:49,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:41:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:41:49,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:41:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1298091, now seen corresponding path program 1 times [2018-11-23 05:41:49,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:41:49,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:41:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:41:49,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:41:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:41:49,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:41:49,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:41:49,179 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 05:41:49,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:41:49,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:41:49,189 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2018-11-23 05:41:49,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:41:49,213 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-11-23 05:41:49,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:41:49,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2018-11-23 05:41:49,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 05:41:49,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 7 states and 7 transitions. [2018-11-23 05:41:49,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 05:41:49,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 05:41:49,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2018-11-23 05:41:49,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:41:49,221 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-11-23 05:41:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2018-11-23 05:41:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-23 05:41:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 05:41:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-11-23 05:41:49,239 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-11-23 05:41:49,239 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-11-23 05:41:49,239 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:41:49,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2018-11-23 05:41:49,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 05:41:49,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:41:49,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:41:49,240 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 05:41:49,240 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 05:41:49,240 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(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.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.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 write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L555 assume !(test_fun_#t~mem5 <= 0);havoc test_fun_#t~mem5; 36#L558-5 [2018-11-23 05:41:49,240 INFO L796 eck$LassoCheckResult]: Loop: 36#L558-5 call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; 37#L558-1 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short11 := test_fun_#t~mem10 <= 2147483647 - test_fun_#t~mem9; 39#L558-3 assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short11;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L559 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 36#L558-5 [2018-11-23 05:41:49,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:41:49,241 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-23 05:41:49,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:41:49,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:41:49,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:41:49,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:41:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:41:49,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:41:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1296169, now seen corresponding path program 1 times [2018-11-23 05:41:49,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:41:49,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:41:49,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:41:49,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:41:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:41:49,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:41:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1806905932, now seen corresponding path program 1 times [2018-11-23 05:41:49,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:41:49,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:41:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:41:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:41:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:41:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:41:49,505 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-23 05:41:49,812 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-23 05:41:49,909 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:41:49,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:41:49,911 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:41:49,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:41:49,911 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:41:49,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:41:49,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:41:49,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:41:49,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-23 05:41:49,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:41:49,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:41:49,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,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-11-23 05:41:49,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,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-11-23 05:41:49,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-11-23 05:41:49,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-11-23 05:41:49,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-11-23 05:41:49,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-11-23 05:41:49,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:49,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:50,173 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2018-11-23 05:41:50,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:50,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:50,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:50,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:41:50,591 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:41:50,594 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:41:50,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:41:50,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:41:50,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:41:50,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:41:50,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:41:50,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:41:50,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:41:50,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:41:50,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:41:50,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:41:50,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:41:50,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:41:50,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:41:50,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:41:50,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:41:50,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:41:50,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:41:50,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:41:50,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:41:50,679 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:41:50,698 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 05:41:50,698 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 05:41:50,700 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:41:50,702 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:41:50,702 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:41:50,702 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2018-11-23 05:41:50,777 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 05:41:50,783 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 05:41:50,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:41:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:41:50,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:41:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:41:50,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:41:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:41:50,909 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 05:41:50,910 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 7 transitions. cyclomatic complexity: 1 Second operand 5 states. [2018-11-23 05:41:50,964 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. [2018-11-23 05:41:50,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 05:41:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 05:41:50,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-11-23 05:41:50,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-23 05:41:50,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:41:50,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 05:41:50,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:41:50,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-23 05:41:50,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:41:50,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-23 05:41:50,969 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:41:50,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2018-11-23 05:41:50,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 05:41:50,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 05:41:50,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 05:41:50,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:41:50,970 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:41:50,970 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:41:50,970 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:41:50,970 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:41:50,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:41:50,970 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:41:50,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 05:41:50,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:41:50 BoogieIcfgContainer [2018-11-23 05:41:50,975 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:41:50,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:41:50,976 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:41:50,976 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:41:50,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:41:48" (3/4) ... [2018-11-23 05:41:50,979 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:41:50,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:41:50,980 INFO L168 Benchmark]: Toolchain (without parser) took 2620.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 955.5 MB in the beginning and 977.4 MB in the end (delta: -21.9 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:41:50,980 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:41:50,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:41:50,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.06 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:41:50,982 INFO L168 Benchmark]: Boogie Preprocessor took 17.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:41:50,982 INFO L168 Benchmark]: RCFGBuilder took 207.84 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:41:50,982 INFO L168 Benchmark]: BuchiAutomizer took 2030.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.4 MB in the end (delta: 118.0 MB). Peak memory consumption was 118.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:41:50,983 INFO L168 Benchmark]: Witness Printer took 3.45 ms. Allocated memory is still 1.2 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:41:50,985 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 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.06 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.55 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 207.84 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2030.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.4 MB in the end (delta: 118.0 MB). Peak memory consumption was 118.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.45 ms. Allocated memory is still 1.2 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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[z_ref][z_ref] + 4294967293 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 1.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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, 4 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: inital295 mio100 ax106 hnf100 lsp91 ukn66 mio100 lsp35 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...