./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3607a2efd08edc90448739913473b3ff26ff3cc3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:11:07,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:11:07,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:11:07,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:11:07,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:11:07,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:11:07,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:11:07,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:11:07,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:11:07,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:11:07,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:11:07,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:11:07,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:11:07,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:11:07,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:11:07,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:11:07,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:11:07,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:11:07,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:11:07,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:11:07,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:11:07,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:11:07,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:11:07,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:11:07,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:11:07,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:11:07,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:11:07,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:11:07,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:11:07,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:11:07,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:11:07,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:11:07,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:11:07,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:11:07,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:11:07,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:11:07,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:11:07,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:11:07,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:11:07,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:11:07,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:11:07,663 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:11:07,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:11:07,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:11:07,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:11:07,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:11:07,702 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:11:07,703 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:11:07,703 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:11:07,703 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:11:07,703 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:11:07,704 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:11:07,704 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:11:07,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:11:07,704 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:11:07,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:11:07,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:11:07,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:11:07,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:11:07,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:11:07,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:11:07,707 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:11:07,707 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:11:07,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:11:07,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:11:07,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:11:07,708 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:11:07,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:11:07,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:11:07,709 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:11:07,710 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:11:07,713 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3607a2efd08edc90448739913473b3ff26ff3cc3 [2019-11-16 00:11:07,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:11:07,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:11:07,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:11:07,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:11:07,758 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:11:07,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2019-11-16 00:11:07,811 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/data/1dff841b1/739d2b49d908439a8f3c8afa2bf28b82/FLAG1d46e1ac8 [2019-11-16 00:11:08,246 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:11:08,247 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/sv-benchmarks/c/termination-memory-alloca/aviad_true-alloca.i [2019-11-16 00:11:08,265 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/data/1dff841b1/739d2b49d908439a8f3c8afa2bf28b82/FLAG1d46e1ac8 [2019-11-16 00:11:08,548 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/data/1dff841b1/739d2b49d908439a8f3c8afa2bf28b82 [2019-11-16 00:11:08,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:11:08,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:11:08,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:08,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:11:08,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:11:08,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:08" (1/1) ... [2019-11-16 00:11:08,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7c0b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:08, skipping insertion in model container [2019-11-16 00:11:08,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:08" (1/1) ... [2019-11-16 00:11:08,569 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:11:08,611 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:11:08,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:08,977 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:11:09,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:09,072 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:11:09,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09 WrapperNode [2019-11-16 00:11:09,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:09,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:09,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:11:09,074 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:11:09,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... [2019-11-16 00:11:09,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... [2019-11-16 00:11:09,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:11:09,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:11:09,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:11:09,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:11:09,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... [2019-11-16 00:11:09,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... [2019-11-16 00:11:09,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... [2019-11-16 00:11:09,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... [2019-11-16 00:11:09,142 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... [2019-11-16 00:11:09,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... [2019-11-16 00:11:09,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... [2019-11-16 00:11:09,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:11:09,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:11:09,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:11:09,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:11:09,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a8fe9147-a786-409e-8c6c-e620719cf0d9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:11:09,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:11:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:11:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:11:09,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:11:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:11:09,561 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:11:09,561 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:11:09,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:09 BoogieIcfgContainer [2019-11-16 00:11:09,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:11:09,563 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:11:09,563 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:11:09,567 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:11:09,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:11:09,568 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:11:08" (1/3) ... [2019-11-16 00:11:09,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cd4d3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:11:09, skipping insertion in model container [2019-11-16 00:11:09,569 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:11:09,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:09" (2/3) ... [2019-11-16 00:11:09,569 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cd4d3c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:11:09, skipping insertion in model container [2019-11-16 00:11:09,570 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:11:09,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:09" (3/3) ... [2019-11-16 00:11:09,571 INFO L371 chiAutomizerObserver]: Analyzing ICFG aviad_true-alloca.i [2019-11-16 00:11:09,617 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:11:09,617 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:11:09,617 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:11:09,617 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:11:09,618 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:11:09,618 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:11:09,618 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:11:09,618 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:11:09,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-16 00:11:09,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:11:09,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:09,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:09,658 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:11:09,658 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:11:09,658 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:11:09,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-16 00:11:09,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:11:09,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:11:09,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:11:09,660 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:11:09,660 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:11:09,666 INFO L791 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~ret14, main_~x~0, main_~count~1;main_~x~0 := main_#t~nondet13;havoc main_#t~nondet13;f_#in~a := main_~x~0;havoc f_#res;havoc f_#t~malloc2.base, f_#t~malloc2.offset, f_#t~malloc3.base, f_#t~malloc3.offset, f_#t~malloc4.base, f_#t~malloc4.offset, f_#t~mem6, f_#t~mem7, f_#t~mem8, f_#t~mem9, f_#t~mem10, f_#t~post11, f_#t~mem5, f_#t~mem12, f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, f_~tmp~0.base, f_~tmp~0.offset, f_~count~0.base, f_~count~0.offset;f_~a := f_#in~a;call f_#t~malloc2.base, f_#t~malloc2.offset := #Ultimate.allocOnStack(4);f_~a_ref~0.base, f_~a_ref~0.offset := f_#t~malloc2.base, f_#t~malloc2.offset;call f_#t~malloc3.base, f_#t~malloc3.offset := #Ultimate.allocOnStack(4);f_~tmp~0.base, f_~tmp~0.offset := f_#t~malloc3.base, f_#t~malloc3.offset;call f_#t~malloc4.base, f_#t~malloc4.offset := #Ultimate.allocOnStack(4);f_~count~0.base, f_~count~0.offset := f_#t~malloc4.base, f_#t~malloc4.offset;call write~int(f_~a, f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(0, f_~tmp~0.base, f_~tmp~0.offset, 4);call write~int(0, f_~count~0.base, f_~count~0.offset, 4); 6#L554-3true [2019-11-16 00:11:09,666 INFO L793 eck$LassoCheckResult]: Loop: 6#L554-3true call f_#t~mem5 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4); 4#L554-1true assume !!(f_#t~mem5 > 1);havoc f_#t~mem5;call f_#t~mem6 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int((if f_#t~mem6 < 0 && 0 != f_#t~mem6 % 2 then f_#t~mem6 % 2 - 2 else f_#t~mem6 % 2), f_~tmp~0.base, f_~tmp~0.offset, 4);havoc f_#t~mem6;call f_#t~mem7 := read~int(f_~tmp~0.base, f_~tmp~0.offset, 4); 7#L556true assume !(0 == f_#t~mem7);havoc f_#t~mem7;call f_#t~mem9 := read~int(f_~a_ref~0.base, f_~a_ref~0.offset, 4);call write~int(f_#t~mem9 - 1, f_~a_ref~0.base, f_~a_ref~0.offset, 4);havoc f_#t~mem9; 13#L556-2true call f_#t~mem10 := read~int(f_~count~0.base, f_~count~0.offset, 4);f_#t~post11 := f_#t~mem10;call write~int(1 + f_#t~post11, f_~count~0.base, f_~count~0.offset, 4);havoc f_#t~post11;havoc f_#t~mem10; 6#L554-3true [2019-11-16 00:11:09,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:09,670 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-16 00:11:09,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:09,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831503572] [2019-11-16 00:11:09,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:09,828 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:09,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:09,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1144136, now seen corresponding path program 1 times [2019-11-16 00:11:09,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:09,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208715318] [2019-11-16 00:11:09,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:09,874 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:09,876 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2019-11-16 00:11:09,876 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:09,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248961626] [2019-11-16 00:11:09,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:09,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:11:09,971 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:11:10,098 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-16 00:11:10,429 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-11-16 00:11:10,845 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-11-16 00:11:11,008 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-16 00:11:11,024 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:11:11,025 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:11:11,025 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:11:11,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:11:11,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:11:11,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:11:11,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:11:11,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:11:11,027 INFO L131 ssoRankerPreferences]: Filename of dumped script: aviad_true-alloca.i_Iteration1_Lasso [2019-11-16 00:11:11,027 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:11:11,028 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:11:11,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,538 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-11-16 00:11:11,713 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-16 00:11:11,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:11,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:11:12,673 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-16 00:11:12,765 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:11:12,770 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:11:12,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,775 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:12,775 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,776 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,778 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:12,778 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:12,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,782 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:12,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,783 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:12,784 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:12,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,786 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,786 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:12,786 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,786 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,786 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,787 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:12,787 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:12,788 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,789 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:12,790 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,790 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,790 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,790 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:12,791 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:12,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:12,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,794 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:12,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:12,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,797 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:12,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,798 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,798 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,798 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:12,798 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:12,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,800 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,803 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:12,804 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:12,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,811 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:12,811 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:12,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,815 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,816 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,818 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:12,818 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:12,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,824 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:12,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,825 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,825 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:12,825 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:12,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,830 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:12,830 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:12,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,835 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:11:12,835 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,836 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:11:12,836 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:11:12,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,839 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,839 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,839 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,842 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:12,842 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:12,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,858 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:12,859 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:12,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,864 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,866 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:12,866 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:12,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:12,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,878 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,884 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:12,885 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:12,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:12,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:12,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:12,947 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-16 00:11:12,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:12,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:12,955 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-16 00:11:12,956 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:13,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:13,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:13,002 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:13,002 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:13,002 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:13,002 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:13,004 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:13,004 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:13,012 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:11:13,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:11:13,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:11:13,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:11:13,013 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:11:13,013 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:11:13,016 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:11:13,016 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:11:13,037 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:11:13,062 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:11:13,063 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:11:13,067 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:11:13,069 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:11:13,069 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:11:13,070 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~a_ref~0.base) ULTIMATE.start_f_~a_ref~0.offset)_1 Supporting invariants [] [2019-11-16 00:11:13,162 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-16 00:11:13,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:11:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:13,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:11:13,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:13,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:11:13,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:13,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,378 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:13,378 INFO L375 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 61 [2019-11-16 00:11:13,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:13,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,387 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:13,429 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:13,430 INFO L375 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 69 [2019-11-16 00:11:13,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:13,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:13,445 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:13,483 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:13,483 INFO L375 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 60 [2019-11-16 00:11:13,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:13,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:13,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,493 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:13,610 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2019-11-16 00:11:13,611 INFO L567 ElimStorePlain]: treesize reduction 109, result has 42.9 percent of original size [2019-11-16 00:11:13,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-16 00:11:13,617 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:154, output treesize:82 [2019-11-16 00:11:13,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:13,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:13,758 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:13,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 73 [2019-11-16 00:11:13,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:13,771 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2019-11-16 00:11:13,772 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:13,928 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2019-11-16 00:11:13,929 INFO L567 ElimStorePlain]: treesize reduction 54, result has 54.6 percent of original size [2019-11-16 00:11:13,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-16 00:11:13,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:65 [2019-11-16 00:11:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:14,001 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-16 00:11:14,002 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2019-11-16 00:11:14,126 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 22 states and 26 transitions. Complement of second has 10 states. [2019-11-16 00:11:14,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:11:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:11:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2019-11-16 00:11:14,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-16 00:11:14,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:14,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:11:14,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:14,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-16 00:11:14,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:11:14,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2019-11-16 00:11:14,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:11:14,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-11-16 00:11:14,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:11:14,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:11:14,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:11:14,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:11:14,139 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:11:14,139 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:11:14,139 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:11:14,139 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:11:14,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:11:14,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:11:14,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:11:14,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:11:14 BoogieIcfgContainer [2019-11-16 00:11:14,144 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:11:14,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:11:14,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:11:14,145 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:11:14,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:09" (3/4) ... [2019-11-16 00:11:14,149 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:11:14,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:11:14,151 INFO L168 Benchmark]: Toolchain (without parser) took 5599.36 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 246.9 MB). Free memory was 941.1 MB in the beginning and 1.2 GB in the end (delta: -280.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:14,154 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:14,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 941.1 MB in the beginning and 1.2 GB in the end (delta: -249.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:14,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:14,155 INFO L168 Benchmark]: Boogie Preprocessor took 24.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:14,156 INFO L168 Benchmark]: RCFGBuilder took 411.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:14,157 INFO L168 Benchmark]: BuchiAutomizer took 4581.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 38.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:14,157 INFO L168 Benchmark]: Witness Printer took 4.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:14,160 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 941.1 MB in the beginning and 1.2 GB in the end (delta: -249.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 411.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4581.86 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 38.8 MB). Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -52.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[a_ref][a_ref] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 2 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 21 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital442 mio100 ax104 hnf100 lsp94 ukn42 mio100 lsp36 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf293 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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...