./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/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 e6c4332f1874752b59e29803328ba77ee4005585 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:16,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:16,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:16,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:16,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:16,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:16,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:16,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:16,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:16,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:16,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:16,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:16,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:16,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:16,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:16,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:16,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:16,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:16,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:16,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:16,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:16,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:16,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:16,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:16,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:16,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:16,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:16,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:16,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:16,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:16,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:16,480 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:16,481 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:16,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:16,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:16,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:16,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:16,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:16,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:16,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:16,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:16,485 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:16,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:16,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:16,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:16,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:16,499 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:16,499 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:16,499 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:16,499 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:16,499 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:16,500 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:16,500 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:16,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:16,500 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:16,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:16,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:16,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:16,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:16,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:16,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:16,502 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:16,502 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:16,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:16,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:16,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:16,502 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:16,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:16,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:16,503 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:16,504 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:16,504 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/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 -> e6c4332f1874752b59e29803328ba77ee4005585 [2019-10-22 08:58:16,528 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:16,538 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:16,541 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:16,542 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:16,542 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:16,543 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2019-10-22 08:58:16,597 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/data/7d8d3bb86/79e7572874b4421e898b62a171a87ea8/FLAGf527ba2a6 [2019-10-22 08:58:17,048 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:17,049 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2019-10-22 08:58:17,060 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/data/7d8d3bb86/79e7572874b4421e898b62a171a87ea8/FLAGf527ba2a6 [2019-10-22 08:58:17,564 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/data/7d8d3bb86/79e7572874b4421e898b62a171a87ea8 [2019-10-22 08:58:17,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:17,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:17,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:17,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:17,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:17,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:17" (1/1) ... [2019-10-22 08:58:17,576 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eacf9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:17, skipping insertion in model container [2019-10-22 08:58:17,576 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:17" (1/1) ... [2019-10-22 08:58:17,583 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:17,621 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:17,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:17,984 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:18,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:18,075 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:18,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18 WrapperNode [2019-10-22 08:58:18,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:18,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:18,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:18,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:18,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:18,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:18,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:18,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:18,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... [2019-10-22 08:58:18,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:18,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:18,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:18,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:18,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7920d353-6fdc-40be-9cff-400c7515b19f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:58:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:58:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:18,687 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:18,687 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:58:18,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:18 BoogieIcfgContainer [2019-10-22 08:58:18,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:18,689 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:18,689 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:18,694 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:18,695 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:18,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:17" (1/3) ... [2019-10-22 08:58:18,696 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ec51107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:18, skipping insertion in model container [2019-10-22 08:58:18,697 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:18,697 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:18" (2/3) ... [2019-10-22 08:58:18,697 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ec51107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:18, skipping insertion in model container [2019-10-22 08:58:18,698 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:18,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:18" (3/3) ... [2019-10-22 08:58:18,700 INFO L371 chiAutomizerObserver]: Analyzing ICFG a.06-alloca.i [2019-10-22 08:58:18,754 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:18,754 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:18,755 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:18,755 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:18,755 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:18,756 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:18,756 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:18,756 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:18,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-10-22 08:58:18,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-10-22 08:58:18,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:18,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:18,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:18,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:18,803 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:18,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2019-10-22 08:58:18,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-10-22 08:58:18,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:18,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:18,805 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:18,806 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:18,813 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 4#L557-20true [2019-10-22 08:58:18,814 INFO L793 eck$LassoCheckResult]: Loop: 4#L557-20true call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 7#L557-1true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 10#L557-3true test_fun_#t~short14 := test_fun_#t~short9; 13#L557-4true assume test_fun_#t~short14; 3#L557-9true test_fun_#t~short18 := test_fun_#t~short14; 5#L557-10true assume !test_fun_#t~short18; 8#L557-12true test_fun_#t~short20 := test_fun_#t~short18; 9#L557-13true assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 14#L557-15true test_fun_#t~short22 := test_fun_#t~short20; 16#L557-16true assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 20#L557-18true assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~short13;havoc test_fun_#t~mem16;havoc test_fun_#t~short18;havoc test_fun_#t~short9;havoc test_fun_#t~mem17;havoc test_fun_#t~mem8;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;havoc test_fun_#t~short14;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 4#L557-20true [2019-10-22 08:58:18,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:18,820 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:58:18,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:18,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223737443] [2019-10-22 08:58:18,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:18,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,034 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:19,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1442805661, now seen corresponding path program 1 times [2019-10-22 08:58:19,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922307077] [2019-10-22 08:58:19,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:19,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922307077] [2019-10-22 08:58:19,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:19,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:19,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487271530] [2019-10-22 08:58:19,110 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:19,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:19,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:19,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:19,129 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2019-10-22 08:58:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:19,186 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-10-22 08:58:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:19,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-10-22 08:58:19,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2019-10-22 08:58:19,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 30 transitions. [2019-10-22 08:58:19,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 08:58:19,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:58:19,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2019-10-22 08:58:19,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:19,197 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2019-10-22 08:58:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2019-10-22 08:58:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-10-22 08:58:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 08:58:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-10-22 08:58:19,229 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 08:58:19,229 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 08:58:19,229 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:19,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-10-22 08:58:19,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 08:58:19,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:19,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:19,230 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:58:19,230 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:19,231 INFO L791 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 havoc main_#res;havoc main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~ret29;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet26, main_#t~nondet27, main_#t~nondet28;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem23, test_fun_#t~mem24, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem7, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~short13, test_fun_#t~short14, test_fun_#t~mem17, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~short18, test_fun_#t~mem19, test_fun_#t~short20, test_fun_#t~mem21, test_fun_#t~short22, test_fun_#t~mem25, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 61#L557-20 [2019-10-22 08:58:19,231 INFO L793 eck$LassoCheckResult]: Loop: 61#L557-20 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 >= 0; 62#L557-1 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647 - test_fun_#t~mem7; 64#L557-3 test_fun_#t~short14 := test_fun_#t~short9; 67#L557-4 assume test_fun_#t~short14; 59#L557-9 test_fun_#t~short18 := test_fun_#t~short14; 60#L557-10 assume test_fun_#t~short18;call test_fun_#t~mem17 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem16 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short18 := test_fun_#t~mem17 > test_fun_#t~mem15 + test_fun_#t~mem16; 63#L557-12 test_fun_#t~short20 := test_fun_#t~short18; 65#L557-13 assume test_fun_#t~short20;call test_fun_#t~mem19 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short20 := test_fun_#t~mem19 < 2147483647; 66#L557-15 test_fun_#t~short22 := test_fun_#t~short20; 70#L557-16 assume test_fun_#t~short22;call test_fun_#t~mem21 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short22 := test_fun_#t~mem21 < 2147483647; 72#L557-18 assume !!test_fun_#t~short22;havoc test_fun_#t~mem10;havoc test_fun_#t~mem21;havoc test_fun_#t~mem11;havoc test_fun_#t~mem6;havoc test_fun_#t~short22;havoc test_fun_#t~mem12;havoc test_fun_#t~mem7;havoc test_fun_#t~mem15;havoc test_fun_#t~short13;havoc test_fun_#t~mem16;havoc test_fun_#t~short18;havoc test_fun_#t~short9;havoc test_fun_#t~mem17;havoc test_fun_#t~mem8;havoc test_fun_#t~mem19;havoc test_fun_#t~short20;havoc test_fun_#t~short14;call test_fun_#t~mem23 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem23, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem23;call test_fun_#t~mem24 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem24, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem24; 61#L557-20 [2019-10-22 08:58:19,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:58:19,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771792711] [2019-10-22 08:58:19,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,343 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1500063963, now seen corresponding path program 1 times [2019-10-22 08:58:19,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575773930] [2019-10-22 08:58:19,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,408 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:19,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1876539869, now seen corresponding path program 1 times [2019-10-22 08:58:19,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:19,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318111005] [2019-10-22 08:58:19,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:19,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:19,498 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:19,997 WARN L191 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 79 [2019-10-22 08:58:20,739 WARN L191 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-10-22 08:58:20,951 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-22 08:58:20,964 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:20,965 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:20,965 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:20,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:20,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:20,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:20,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:20,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:20,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration2_Lasso [2019-10-22 08:58:20,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:20,969 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:20,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,633 WARN L191 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 100 [2019-10-22 08:58:21,798 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-10-22 08:58:21,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:21,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:22,001 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-22 08:58:23,042 WARN L191 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 08:58:23,091 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:23,099 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:23,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,103 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,105 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,111 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,111 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,111 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,113 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,113 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,114 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,114 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,115 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,122 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,122 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,124 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,124 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,124 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,124 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,125 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,125 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,126 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,127 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,130 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,130 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,130 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,131 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,131 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,135 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,135 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,138 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,139 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,141 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,145 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,145 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,146 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:23,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,147 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:23,147 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:23,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,149 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,150 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,151 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,157 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,157 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,190 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,190 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,225 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,229 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,229 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,229 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,230 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,230 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,234 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,235 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,235 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:23,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:58:23,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:23,241 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:23,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:23,242 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:23,249 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:23,249 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:23,296 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:23,328 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:23,330 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:58:23,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:23,333 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:23,334 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:23,335 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2019-10-22 08:58:23,477 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-10-22 08:58:23,484 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:23,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:23,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:23,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:58:23,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:23,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:23,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:23,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:23,600 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 08:58:23,601 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-10-22 08:58:23,731 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 34 states and 46 transitions. Complement of second has 10 states. [2019-10-22 08:58:23,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:58:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-10-22 08:58:23,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 11 letters. [2019-10-22 08:58:23,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:23,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 13 letters. Loop has 11 letters. [2019-10-22 08:58:23,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:23,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 22 letters. [2019-10-22 08:58:23,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:23,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 46 transitions. [2019-10-22 08:58:23,740 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:23,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2019-10-22 08:58:23,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:23,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:23,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:23,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:23,741 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:23,741 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:23,741 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:23,741 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:23,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:23,741 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:23,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:23,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:23 BoogieIcfgContainer [2019-10-22 08:58:23,749 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:23,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:23,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:23,754 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:23,755 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:18" (3/4) ... [2019-10-22 08:58:23,758 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:23,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:23,760 INFO L168 Benchmark]: Toolchain (without parser) took 6192.02 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 939.1 MB in the beginning and 1.2 GB in the end (delta: -269.9 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,761 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:23,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.39 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,763 INFO L168 Benchmark]: Boogie Preprocessor took 54.63 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. [2019-10-22 08:58:23,763 INFO L168 Benchmark]: RCFGBuilder took 508.46 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: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,764 INFO L168 Benchmark]: BuchiAutomizer took 5059.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -124.3 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:23,764 INFO L168 Benchmark]: Witness Printer took 9.73 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:23,767 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 507.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.39 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.63 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 508.46 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: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5059.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -124.3 MB). Peak memory consumption was 52.9 MB. Max. memory is 11.5 GB. * Witness Printer took 9.73 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 4294967293 and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 35 SDtfs, 28 SDslu, 71 SDs, 0 SdLazy, 55 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital458 mio100 ax103 hnf100 lsp94 ukn55 mio100 lsp36 div100 bol100 ite100 ukn100 eq192 hnf87 smp96 dnf590 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...