./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.05-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_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/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 f1e9ba7e316537618e1819aa49662575d0a5a8e7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:02:18,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:18,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:18,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:18,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:18,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:18,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:18,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:18,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:18,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:18,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:18,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:18,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:18,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:18,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:18,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:18,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:18,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:18,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:18,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:18,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:18,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:18,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:18,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:18,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:18,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:18,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:18,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:18,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:18,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:18,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:18,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:18,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:18,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:18,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:18,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:18,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:18,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:18,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:18,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:18,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:18,772 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:02:18,787 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:18,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:18,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:18,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:18,789 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:18,789 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:18,790 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:18,790 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:18,790 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:18,790 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:18,791 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:18,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:18,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:18,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:18,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:18,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:18,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:18,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:18,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:18,793 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:18,793 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:18,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:18,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:18,794 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:18,794 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:18,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:18,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:18,795 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:18,796 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:18,796 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_dc87d576-21d5-485e-a6b1-de36df43fe50/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 -> f1e9ba7e316537618e1819aa49662575d0a5a8e7 [2019-10-22 09:02:18,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:18,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:18,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:18,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:18,843 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:18,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2019-10-22 09:02:18,901 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/data/1d24b54e8/ae4b2d27ba8641b78e5e4f48c648d20c/FLAGabc756260 [2019-10-22 09:02:19,382 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:19,383 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/sv-benchmarks/c/termination-memory-alloca/b.05-alloca.i [2019-10-22 09:02:19,394 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/data/1d24b54e8/ae4b2d27ba8641b78e5e4f48c648d20c/FLAGabc756260 [2019-10-22 09:02:19,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/bin/uautomizer/data/1d24b54e8/ae4b2d27ba8641b78e5e4f48c648d20c [2019-10-22 09:02:19,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:19,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:19,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:19,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:19,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:19,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f4dd4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:19, skipping insertion in model container [2019-10-22 09:02:19,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:19" (1/1) ... [2019-10-22 09:02:19,728 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:19,767 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:20,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:20,172 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:20,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:20,262 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:20,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20 WrapperNode [2019-10-22 09:02:20,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:20,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:20,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:20,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:20,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... [2019-10-22 09:02:20,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... [2019-10-22 09:02:20,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:20,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:20,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:20,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:20,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... [2019-10-22 09:02:20,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... [2019-10-22 09:02:20,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... [2019-10-22 09:02:20,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... [2019-10-22 09:02:20,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... [2019-10-22 09:02:20,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... [2019-10-22 09:02:20,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... [2019-10-22 09:02:20,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:20,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:20,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:20,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:20,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_dc87d576-21d5-485e-a6b1-de36df43fe50/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 09:02:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:20,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:20,696 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:20,696 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:20,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:20 BoogieIcfgContainer [2019-10-22 09:02:20,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:20,698 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:20,698 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:20,702 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:20,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:20,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:19" (1/3) ... [2019-10-22 09:02:20,704 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dc5d400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:20, skipping insertion in model container [2019-10-22 09:02:20,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:20,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:20" (2/3) ... [2019-10-22 09:02:20,705 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dc5d400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:20, skipping insertion in model container [2019-10-22 09:02:20,705 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:20,705 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:20" (3/3) ... [2019-10-22 09:02:20,708 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.05-alloca.i [2019-10-22 09:02:20,763 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:20,763 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:20,763 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:20,764 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:20,764 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:20,764 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:20,764 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:20,764 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:20,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:02:20,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:02:20,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:20,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:20,810 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:02:20,811 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:20,811 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:20,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-10-22 09:02:20,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:02:20,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:20,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:20,813 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:02:20,813 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:20,821 INFO L791 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 6#L554-11true [2019-10-22 09:02:20,822 INFO L793 eck$LassoCheckResult]: Loop: 6#L554-11true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 8#L554-1true assume test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 >= 0; 12#L554-3true test_fun_#t~short9 := test_fun_#t~short7; 14#L554-4true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3#L554-6true test_fun_#t~short11 := test_fun_#t~short9; 4#L554-7true assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 5#L554-9true assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 6#L554-11true [2019-10-22 09:02:20,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,826 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:02:20,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743733609] [2019-10-22 09:02:20,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:20,970 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,971 INFO L82 PathProgramCache]: Analyzing trace with hash -334850282, now seen corresponding path program 1 times [2019-10-22 09:02:20,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972481822] [2019-10-22 09:02:20,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,016 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:21,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:21,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1211446548, now seen corresponding path program 1 times [2019-10-22 09:02:21,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:21,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122570642] [2019-10-22 09:02:21,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:21,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:21,103 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:21,392 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-10-22 09:02:21,689 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-10-22 09:02:21,804 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:21,805 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:21,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:21,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:21,806 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:21,807 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:21,807 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:21,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:21,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.05-alloca.i_Iteration1_Lasso [2019-10-22 09:02:21,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:21,808 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:21,835 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 09:02:21,842 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 09:02:21,844 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 09:02:21,847 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 09:02:21,850 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 09:02:21,856 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 09:02:21,859 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 09:02:21,863 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 09:02:21,867 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 09:02:21,871 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 09:02:21,875 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 09:02:21,880 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 09:02:21,882 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 09:02:21,890 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 09:02:21,892 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 09:02:22,133 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-10-22 09:02:22,253 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-22 09:02:22,253 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 09:02:22,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:22,261 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 09:02:22,264 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 09:02:22,268 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 09:02:22,782 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:02:22,908 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:22,915 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:22,917 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 09:02:22,919 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,924 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,928 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 09:02:22,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,930 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,931 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,931 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,932 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 09:02:22,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,934 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,934 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,934 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,940 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 09:02:22,941 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,942 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,943 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,944 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,947 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 09:02:22,948 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,949 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,951 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:22,951 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:22,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,959 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 09:02:22,960 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,961 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,961 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,961 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,962 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,964 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,965 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 09:02:22,966 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,966 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,967 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,967 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,967 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,969 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 09:02:22,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,969 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,971 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,972 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 09:02:22,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,973 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,973 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,973 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,974 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,974 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,976 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 09:02:22,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,979 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:22,979 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:22,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,984 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 09:02:22,985 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,985 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,987 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:22,987 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:22,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,991 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 09:02:22,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:22,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,993 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:22,993 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:22,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:22,995 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 09:02:22,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:22,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:22,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:22,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:22,997 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:22,998 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,003 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 09:02:23,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:23,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,004 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,004 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:23,005 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:23,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,009 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 09:02:23,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,010 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:02:23,010 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,014 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:02:23,020 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,050 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 09:02:23,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:23,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,063 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 09:02:23,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,064 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,065 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:23,066 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,079 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 09:02:23,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,081 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:23,081 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,090 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 09:02:23,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,092 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:23,092 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:23,098 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 09:02:23,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:23,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:23,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:23,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:23,102 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:23,102 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:23,141 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:23,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:02:23,168 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:02:23,174 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:23,176 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:23,176 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:23,177 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-10-22 09:02:23,216 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 09:02:23,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:02:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 09:02:23,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:02:23,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:23,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,414 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 09:02:23,430 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:02:23,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 4 states. [2019-10-22 09:02:23,570 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 4 states. Result 42 states and 57 transitions. Complement of second has 10 states. [2019-10-22 09:02:23,570 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-10-22 09:02:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:02:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2019-10-22 09:02:23,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 7 letters. [2019-10-22 09:02:23,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:23,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 9 letters. Loop has 7 letters. [2019-10-22 09:02:23,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:23,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 2 letters. Loop has 14 letters. [2019-10-22 09:02:23,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:23,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. [2019-10-22 09:02:23,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:02:23,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 24 states and 33 transitions. [2019-10-22 09:02:23,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:23,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:02:23,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 33 transitions. [2019-10-22 09:02:23,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:23,585 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-22 09:02:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 33 transitions. [2019-10-22 09:02:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-22 09:02:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 09:02:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2019-10-22 09:02:23,609 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-10-22 09:02:23,610 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-10-22 09:02:23,610 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:23,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2019-10-22 09:02:23,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:02:23,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:23,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:23,611 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:02:23,611 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,611 INFO L791 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 169#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 170#L554-1 [2019-10-22 09:02:23,612 INFO L793 eck$LassoCheckResult]: Loop: 170#L554-1 assume !test_fun_#t~short7; 171#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 178#L554-4 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 164#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 165#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 176#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 180#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 170#L554-1 [2019-10-22 09:02:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,612 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 09:02:23,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740074022] [2019-10-22 09:02:23,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,654 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash -74889736, now seen corresponding path program 1 times [2019-10-22 09:02:23,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851975479] [2019-10-22 09:02:23,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,702 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 09:02:23,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851975479] [2019-10-22 09:02:23,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:23,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:23,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245479001] [2019-10-22 09:02:23,705 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:23,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:23,710 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 09:02:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,746 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-10-22 09:02:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:02:23,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. [2019-10-22 09:02:23,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:02:23,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 34 transitions. [2019-10-22 09:02:23,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:23,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:02:23,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-10-22 09:02:23,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:02:23,751 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-22 09:02:23,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-10-22 09:02:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-10-22 09:02:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-22 09:02:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-10-22 09:02:23,753 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-10-22 09:02:23,753 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-10-22 09:02:23,753 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:02:23,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-10-22 09:02:23,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 09:02:23,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:23,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:23,756 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:02:23,756 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:23,757 INFO L791 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~tmp := main_#t~nondet15, main_#t~nondet16;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~nondet4, test_fun_#t~mem12, test_fun_#t~nondet13, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem10, test_fun_#t~short11, test_fun_#t~mem14, test_fun_~x, test_fun_~tmp, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~tmp := test_fun_#in~tmp;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_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~tmp, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);call write~int(test_fun_#t~nondet4, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet4; 223#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 228#L554-1 [2019-10-22 09:02:23,757 INFO L793 eck$LassoCheckResult]: Loop: 228#L554-1 assume !test_fun_#t~short7; 229#L554-3 test_fun_#t~short9 := test_fun_#t~short7; 236#L554-4 assume !test_fun_#t~short9; 224#L554-6 test_fun_#t~short11 := test_fun_#t~short9; 225#L554-7 assume test_fun_#t~short11;call test_fun_#t~mem10 := read~int(test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);test_fun_#t~short11 := test_fun_~x == 2 * test_fun_#t~mem10; 234#L554-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~short7;havoc test_fun_#t~mem5;havoc test_fun_#t~short9;havoc test_fun_#t~mem6;havoc test_fun_#t~short11;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12;call write~int(test_fun_#t~nondet13, test_fun_~tmp_ref~0.base, test_fun_~tmp_ref~0.offset, 4);havoc test_fun_#t~nondet13; 238#L554-11 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 228#L554-1 [2019-10-22 09:02:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-10-22 09:02:23,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732037963] [2019-10-22 09:02:23,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:23,793 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:23,795 INFO L82 PathProgramCache]: Analyzing trace with hash -73042694, now seen corresponding path program 1 times [2019-10-22 09:02:23,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:23,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519593533] [2019-10-22 09:02:23,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:23,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:23,828 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 09:02:23,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519593533] [2019-10-22 09:02:23,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:23,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:23,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372798148] [2019-10-22 09:02:23,829 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:02:23,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:23,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:23,830 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-10-22 09:02:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:23,878 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-10-22 09:02:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:02:23,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2019-10-22 09:02:23,880 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:23,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-10-22 09:02:23,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:02:23,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:02:23,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:02:23,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:23,880 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:23,880 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:23,881 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:02:23,881 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:02:23,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:02:23,881 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:02:23,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:02:23,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:02:23 BoogieIcfgContainer [2019-10-22 09:02:23,887 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:02:23,887 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:23,887 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:23,888 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:23,888 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:20" (3/4) ... [2019-10-22 09:02:23,890 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:02:23,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:23,892 INFO L168 Benchmark]: Toolchain (without parser) took 4181.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.4 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -214.0 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:23,892 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:23,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -205.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:23,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.79 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:23,894 INFO L168 Benchmark]: Boogie Preprocessor took 28.01 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 09:02:23,894 INFO L168 Benchmark]: RCFGBuilder took 355.90 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:23,895 INFO L168 Benchmark]: BuchiAutomizer took 3188.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -43.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:23,895 INFO L168 Benchmark]: Witness Printer took 3.41 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 09:02:23,898 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 555.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -205.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.79 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: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.01 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 355.90 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3188.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -43.7 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.41 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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 44 SDslu, 39 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital225 mio100 ax108 hnf100 lsp87 ukn65 mio100 lsp35 div100 bol100 ite100 ukn100 eq172 hnf89 smp92 dnf171 smp95 tf100 neg93 sie125 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...