./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca_true-termination.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_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/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 b64613d278f1b2a5aec6d84cb3470147257700f5 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:40:16,850 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:40:16,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:40:16,858 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:40:16,858 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:40:16,859 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:40:16,860 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:40:16,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:40:16,862 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:40:16,862 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:40:16,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:40:16,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:40:16,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:40:16,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:40:16,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:40:16,866 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:40:16,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:40:16,868 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:40:16,869 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:40:16,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:40:16,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:40:16,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:40:16,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:40:16,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:40:16,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:40:16,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:40:16,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:40:16,875 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:40:16,876 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:40:16,877 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:40:16,877 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:40:16,877 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:40:16,878 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:40:16,878 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:40:16,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:40:16,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:40:16,879 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:40:16,890 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:40:16,890 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:40:16,891 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:40:16,891 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:40:16,891 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:40:16,891 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:40:16,891 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:40:16,892 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:40:16,892 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:40:16,892 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:40:16,892 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:40:16,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:40:16,892 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:40:16,893 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:40:16,893 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:40:16,893 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:40:16,893 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:40:16,893 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:40:16,893 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:40:16,893 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:40:16,894 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:40:16,894 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:40:16,894 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:40:16,894 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:40:16,894 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:40:16,894 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:40:16,895 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:40:16,895 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:40:16,895 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:40:16,896 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_1e05c06a-6758-4416-9761-a0aa5ccce3ef/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 -> b64613d278f1b2a5aec6d84cb3470147257700f5 [2018-11-23 13:40:16,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:40:16,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:40:16,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:40:16,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:40:16,928 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:40:16,929 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i [2018-11-23 13:40:16,962 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/data/23d504cd9/01ffcfaa41d640a49df59b965783f62c/FLAGe8f975947 [2018-11-23 13:40:17,298 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:40:17,298 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca_true-termination.c.i [2018-11-23 13:40:17,308 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/data/23d504cd9/01ffcfaa41d640a49df59b965783f62c/FLAGe8f975947 [2018-11-23 13:40:17,319 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/bin-2019/uautomizer/data/23d504cd9/01ffcfaa41d640a49df59b965783f62c [2018-11-23 13:40:17,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:40:17,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:40:17,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:40:17,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:40:17,325 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:40:17,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,327 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 01:40:17, skipping insertion in model container [2018-11-23 13:40:17,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:40:17,358 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:40:17,538 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:40:17,544 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:40:17,614 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:40:17,637 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:40:17,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17 WrapperNode [2018-11-23 13:40:17,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:40:17,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:40:17,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:40:17,638 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:40:17,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:40:17,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:40:17,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:40:17,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:40:17,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... [2018-11-23 13:40:17,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:40:17,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:40:17,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:40:17,681 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:40:17,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e05c06a-6758-4416-9761-a0aa5ccce3ef/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 13:40:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:40:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:40:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:40:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:40:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:40:17,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:40:17,886 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:40:17,886 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 13:40:17,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:40:17 BoogieIcfgContainer [2018-11-23 13:40:17,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:40:17,887 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:40:17,887 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:40:17,890 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:40:17,891 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:40:17,891 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:40:17" (1/3) ... [2018-11-23 13:40:17,892 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14801c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:40:17, skipping insertion in model container [2018-11-23 13:40:17,892 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:40:17,892 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:40:17" (2/3) ... [2018-11-23 13:40:17,893 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14801c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:40:17, skipping insertion in model container [2018-11-23 13:40:17,893 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:40:17,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:40:17" (3/3) ... [2018-11-23 13:40:17,894 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_AG313-alloca_true-termination.c.i [2018-11-23 13:40:17,938 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:40:17,939 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:40:17,939 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:40:17,939 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:40:17,939 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:40:17,939 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:40:17,939 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:40:17,939 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:40:17,939 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:40:17,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 13:40:17,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:40:17,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:40:17,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:40:17,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:40:17,974 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:40:17,974 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:40:17,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 13:40:17,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:40:17,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:40:17,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:40:17,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:40:17,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:40:17,981 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.alloc(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.alloc(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.alloc(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 10#L555true assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 7#L556-5true [2018-11-23 13:40:17,982 INFO L796 eck$LassoCheckResult]: Loop: 7#L556-5true call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 11#L556-1true assume !quot_#t~short8; 4#L556-3true assume !!quot_#t~short8;havoc quot_#t~short8;havoc quot_#t~mem6;havoc quot_#t~mem7;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem11;havoc quot_#t~mem10; 7#L556-5true [2018-11-23 13:40:17,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:40:17,986 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 13:40:17,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:40:17,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:40:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:40:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:40:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:40:18,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:40:18,089 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2018-11-23 13:40:18,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:40:18,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:40:18,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:40:18,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:40:18,144 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 13:40:18,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:40:18,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:40:18,148 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:40:18,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:40:18,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:40:18,158 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-11-23 13:40:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:40:18,176 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-11-23 13:40:18,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:40:18,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-23 13:40:18,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:40:18,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2018-11-23 13:40:18,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 13:40:18,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 13:40:18,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2018-11-23 13:40:18,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:40:18,185 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-11-23 13:40:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2018-11-23 13:40:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-11-23 13:40:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:40:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-11-23 13:40:18,208 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-11-23 13:40:18,208 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-11-23 13:40:18,208 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:40:18,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2018-11-23 13:40:18,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:40:18,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:40:18,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:40:18,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:40:18,209 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:40:18,210 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.alloc(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.alloc(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.alloc(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 33#L555 assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 35#L556-5 [2018-11-23 13:40:18,210 INFO L796 eck$LassoCheckResult]: Loop: 35#L556-5 call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 37#L556-1 assume quot_#t~short8;call quot_#t~mem7 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem7 > 0; 34#L556-3 assume !!quot_#t~short8;havoc quot_#t~short8;havoc quot_#t~mem6;havoc quot_#t~mem7;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem11;havoc quot_#t~mem10; 35#L556-5 [2018-11-23 13:40:18,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:40:18,210 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-23 13:40:18,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:40:18,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:40:18,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:40:18,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:40:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:40:18,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:40:18,234 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2018-11-23 13:40:18,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:40:18,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:40:18,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:40:18,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:40:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:40:18,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:40:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2018-11-23 13:40:18,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:40:18,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:40:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:40:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:40:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:40:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:40:18,417 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-23 13:40:18,681 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2018-11-23 13:40:18,785 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:40:18,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:40:18,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:40:18,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:40:18,786 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:40:18,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:40:18,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:40:18,787 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:40:18,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_AG313-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 13:40:18,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:40:18,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:40:18,807 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 13:40:18,811 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 13:40:18,812 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 13:40:18,815 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 13:40:18,816 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 13:40:18,818 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 13:40:18,827 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 13:40:18,829 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 13:40:18,831 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 13:40:18,833 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 13:40:19,061 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2018-11-23 13:40:19,131 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 13:40:19,132 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 13:40:19,134 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 13:40:19,135 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 13:40:19,136 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 13:40:19,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:40:19,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:40:19,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:40:19,507 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:40:19,511 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:40:19,512 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 13:40:19,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:40:19,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:40:19,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:40:19,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,517 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 13:40:19,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:40:19,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:40:19,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:40:19,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,520 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 13:40:19,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:40:19,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,524 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 13:40:19,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:40:19,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:40:19,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:40:19,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,526 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 13:40:19,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:40:19,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:40:19,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:40:19,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,532 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 13:40:19,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:40:19,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,538 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 13:40:19,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:40:19,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:40:19,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:40:19,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,540 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 13:40:19,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:40:19,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:40:19,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:40:19,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,542 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 13:40:19,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:40:19,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,547 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 13:40:19,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,547 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:40:19,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,549 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:40:19,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,556 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 13:40:19,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:40:19,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,566 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 13:40:19,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,567 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:40:19,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,569 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:40:19,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,575 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 13:40:19,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:40:19,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,584 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 13:40:19,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:40:19,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,588 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 13:40:19,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,588 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:40:19,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,590 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:40:19,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,595 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 13:40:19,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:40:19,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,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 13:40:19,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:40:19,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,624 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 13:40:19,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:40:19,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:40:19,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:40:19,631 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 13:40:19,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:40:19,631 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:40:19,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:40:19,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:40:19,633 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:40:19,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:40:19,652 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:40:19,664 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:40:19,664 INFO L444 ModelExtractionUtils]: 25 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:40:19,666 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:40:19,668 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:40:19,668 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:40:19,668 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-23 13:40:19,755 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-23 13:40:19,763 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 13:40:19,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:40:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:40:19,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:40:19,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-11-23 13:40:19,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:40:19,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:40:19,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2018-11-23 13:40:19,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 13:40:19,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:40:19,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 13:40:19,892 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:40:19,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2018-11-23 13:40:19,942 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 13:40:19,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 33 [2018-11-23 13:40:19,952 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 13:40:20,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 13:40:20,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 13:40:20,009 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 13:40:20,013 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:40:20,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-11-23 13:40:20,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 13:40:20,016 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 13:40:20,020 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:40:20,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-23 13:40:20,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 13:40:20,027 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-23 13:40:20,034 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:40:20,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-11-23 13:40:20,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:40:20,041 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 13:40:20,046 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:40:20,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-11-23 13:40:20,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 13:40:20,096 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-11-23 13:40:20,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 13:40:20,109 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 13:40:20,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-11-23 13:40:20,121 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 13:40:20,130 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:40:20,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-11-23 13:40:20,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2018-11-23 13:40:20,141 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-23 13:40:20,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 13:40:20,154 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 13:40:20,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 13:40:20,173 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 13:40:20,184 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 13:40:20,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 13:40:20,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 13:40:20,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:40:20,272 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 5 variables, input treesize:68, output treesize:21 [2018-11-23 13:40:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:40:20,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:40:20,354 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 13:40:20,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-23 13:40:20,357 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2018-11-23 13:40:20,401 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2018-11-23 13:40:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:40:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:40:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2018-11-23 13:40:20,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-23 13:40:20,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:40:20,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 13:40:20,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:40:20,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-23 13:40:20,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:40:20,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-23 13:40:20,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:40:20,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-11-23 13:40:20,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:40:20,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:40:20,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:40:20,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:40:20,405 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:40:20,405 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:40:20,405 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:40:20,405 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:40:20,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:40:20,406 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:40:20,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:40:20,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:40:20 BoogieIcfgContainer [2018-11-23 13:40:20,410 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:40:20,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:40:20,410 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:40:20,410 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:40:20,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:40:17" (3/4) ... [2018-11-23 13:40:20,413 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:40:20,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:40:20,413 INFO L168 Benchmark]: Toolchain (without parser) took 3092.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:40:20,414 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:40:20,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:40:20,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.50 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 13:40:20,415 INFO L168 Benchmark]: Boogie Preprocessor took 14.33 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 13:40:20,415 INFO L168 Benchmark]: RCFGBuilder took 205.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:40:20,416 INFO L168 Benchmark]: BuchiAutomizer took 2522.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:40:20,416 INFO L168 Benchmark]: Witness Printer took 2.81 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 13:40:20,418 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.50 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 14.33 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 205.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2522.92 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 unknown-#memory_int-unknown[x_ref][x_ref] 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.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. 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 6 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 1 SDslu, 8 SDs, 0 SdLazy, 13 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital338 mio100 ax105 hnf100 lsp92 ukn56 mio100 lsp39 div100 bol100 ite100 ukn100 eq182 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...