./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.12-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_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/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 27b51ff95b1c87aada11269295eff3fc5c30957f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:57:52,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:52,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:52,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:52,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:52,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:52,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:52,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:52,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:52,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:52,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:52,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:52,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:52,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:52,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:52,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:52,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:52,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:52,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:52,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:52,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:52,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:52,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:52,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:52,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:52,755 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:52,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:52,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:52,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:52,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:52,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:52,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:52,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:52,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:52,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:52,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:52,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:52,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:52,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:52,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:52,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:52,768 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:57:52,787 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:52,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:52,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:52,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:52,789 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:52,789 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:57:52,790 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:57:52,790 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:57:52,790 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:57:52,790 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:57:52,790 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:57:52,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:52,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:57:52,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:52,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:52,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:57:52,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:57:52,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:57:52,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:52,792 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:57:52,792 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:52,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:57:52,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:52,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:52,797 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:57:52,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:52,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:52,798 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:57:52,799 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:57:52,799 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_1fb3a83c-8002-4d52-a9fd-38b5db652a58/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 -> 27b51ff95b1c87aada11269295eff3fc5c30957f [2019-10-22 08:57:52,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:52,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:52,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:52,842 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:52,843 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:52,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2019-10-22 08:57:52,905 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/data/582686fa3/fecbd7151869439cbb1c2406067050ba/FLAG8ea84e88e [2019-10-22 08:57:53,330 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:53,331 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2019-10-22 08:57:53,341 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/data/582686fa3/fecbd7151869439cbb1c2406067050ba/FLAG8ea84e88e [2019-10-22 08:57:53,354 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/bin/uautomizer/data/582686fa3/fecbd7151869439cbb1c2406067050ba [2019-10-22 08:57:53,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:53,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:53,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:53,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:53,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:53,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58628272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53, skipping insertion in model container [2019-10-22 08:57:53,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,372 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:53,406 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:53,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:53,811 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:53,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:53,907 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:53,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53 WrapperNode [2019-10-22 08:57:53,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:53,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:53,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:53,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:53,918 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:57:53" (1/1) ... [2019-10-22 08:57:53,931 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:57:53" (1/1) ... [2019-10-22 08:57:53,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:53,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:53,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:53,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:53,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... [2019-10-22 08:57:53,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:53,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:53,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:53,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:53,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1fb3a83c-8002-4d52-a9fd-38b5db652a58/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:57:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:57:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:54,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:54,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:54,296 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:54,296 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:57:54,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:54 BoogieIcfgContainer [2019-10-22 08:57:54,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:54,298 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:57:54,299 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:57:54,302 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:57:54,303 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:54,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:57:53" (1/3) ... [2019-10-22 08:57:54,304 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66479e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:54, skipping insertion in model container [2019-10-22 08:57:54,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:54,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:53" (2/3) ... [2019-10-22 08:57:54,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66479e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:57:54, skipping insertion in model container [2019-10-22 08:57:54,306 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:57:54,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:54" (3/3) ... [2019-10-22 08:57:54,307 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.12-alloca.i [2019-10-22 08:57:54,354 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:57:54,354 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:57:54,354 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:57:54,354 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:54,355 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:54,355 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:57:54,355 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:54,355 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:57:54,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:57:54,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:57:54,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:54,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:54,398 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:54,398 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:54,398 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:57:54,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:57:54,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:57:54,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:54,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:54,400 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:57:54,400 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:54,408 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7#L559-2true [2019-10-22 08:57:54,409 INFO L793 eck$LassoCheckResult]: Loop: 7#L559-2true 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; 13#L555-1true assume test_fun_#t~short7; 5#L555-3true assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 8#L556true assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 7#L559-2true [2019-10-22 08:57:54,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,415 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:57:54,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956632332] [2019-10-22 08:57:54,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,619 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2019-10-22 08:57:54,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562119596] [2019-10-22 08:57:54,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,652 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:54,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:54,653 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-10-22 08:57:54,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:54,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142529115] [2019-10-22 08:57:54,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:54,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:54,735 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:55,205 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-10-22 08:57:55,350 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-22 08:57:55,364 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:55,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:55,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:55,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:55,366 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:55,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:55,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:55,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:55,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca.i_Iteration1_Lasso [2019-10-22 08:57:55,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:55,367 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:55,393 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:57:55,723 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-10-22 08:57:55,800 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:57:55,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:57:55,806 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:57:55,811 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:57:55,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:57:55,818 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:57:55,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:57:55,825 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:57:55,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:57:55,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:57:55,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:57:55,837 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:57:55,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 08:57:55,845 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:57:55,848 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:57:55,852 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:57:56,603 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 08:57:56,647 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:56,652 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:56,655 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:57:56,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,661 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,661 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:56,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,681 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:57:56,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,687 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,687 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:56,697 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,698 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:57:56,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,702 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,702 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:56,707 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,707 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:57:56,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,711 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:56,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,725 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:57:56,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,726 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,728 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,728 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:56,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,745 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:57:56,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,746 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,746 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,748 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,748 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:56,751 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:56,752 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:57:56,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:56,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:56,753 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:56,753 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:56,755 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:56,755 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:56,791 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:57:56,807 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:57:56,807 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:57:56,809 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:57:56,811 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:57:56,812 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:57:56,812 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 08:57:56,859 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2019-10-22 08:57:56,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:57:56,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:57:56,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:57:56,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:56,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:56,964 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:57:56,975 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 08:57:56,976 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2019-10-22 08:57:57,057 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 50 states and 67 transitions. Complement of second has 9 states. [2019-10-22 08:57:57,058 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 08:57:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:57:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2019-10-22 08:57:57,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 2 letters. Loop has 4 letters. [2019-10-22 08:57:57,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:57,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 08:57:57,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:57,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 2 letters. Loop has 8 letters. [2019-10-22 08:57:57,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:57:57,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 67 transitions. [2019-10-22 08:57:57,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 08:57:57,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 25 states and 39 transitions. [2019-10-22 08:57:57,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:57:57,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:57:57,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 39 transitions. [2019-10-22 08:57:57,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:57,075 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 39 transitions. [2019-10-22 08:57:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 39 transitions. [2019-10-22 08:57:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-22 08:57:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 08:57:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2019-10-22 08:57:57,106 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2019-10-22 08:57:57,107 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2019-10-22 08:57:57,107 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:57:57,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 37 transitions. [2019-10-22 08:57:57,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 08:57:57,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:57,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:57,108 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:57,108 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:57:57,109 INFO L791 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 187#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 188#L559-2 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; 195#L555-1 [2019-10-22 08:57:57,109 INFO L793 eck$LassoCheckResult]: Loop: 195#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 190#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 191#L556 assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 194#L559-2 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; 195#L555-1 [2019-10-22 08:57:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,110 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 08:57:57,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416144057] [2019-10-22 08:57:57,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,147 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2019-10-22 08:57:57,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378159026] [2019-10-22 08:57:57,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,165 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2019-10-22 08:57:57,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610789425] [2019-10-22 08:57:57,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:57,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610789425] [2019-10-22 08:57:57,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:57,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:57,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833043010] [2019-10-22 08:57:57,346 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-22 08:57:57,494 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-22 08:57:57,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:57,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:57,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:57,499 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-10-22 08:57:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:57,555 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2019-10-22 08:57:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:57,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. [2019-10-22 08:57:57,558 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-10-22 08:57:57,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 39 transitions. [2019-10-22 08:57:57,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-10-22 08:57:57,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 08:57:57,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2019-10-22 08:57:57,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:57,560 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-10-22 08:57:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2019-10-22 08:57:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 14. [2019-10-22 08:57:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:57:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-10-22 08:57:57,565 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-10-22 08:57:57,565 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-10-22 08:57:57,565 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:57:57,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-10-22 08:57:57,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:57:57,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:57,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:57,566 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:57,567 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:57,567 INFO L791 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 262#L559-2 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; 269#L555-1 [2019-10-22 08:57:57,567 INFO L793 eck$LassoCheckResult]: Loop: 269#L555-1 assume test_fun_#t~short7; 264#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 265#L556 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 272#L559 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 268#L559-2 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; 269#L555-1 [2019-10-22 08:57:57,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,567 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-10-22 08:57:57,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928221025] [2019-10-22 08:57:57,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,623 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,626 INFO L82 PathProgramCache]: Analyzing trace with hash 38423515, now seen corresponding path program 1 times [2019-10-22 08:57:57,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105690238] [2019-10-22 08:57:57,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,649 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,652 INFO L82 PathProgramCache]: Analyzing trace with hash 177751320, now seen corresponding path program 1 times [2019-10-22 08:57:57,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615438845] [2019-10-22 08:57:57,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:57,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615438845] [2019-10-22 08:57:57,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:57,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:57,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784687537] [2019-10-22 08:57:57,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:57,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:57,779 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-10-22 08:57:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:57,800 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-10-22 08:57:57,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:57,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-10-22 08:57:57,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:57:57,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 15 transitions. [2019-10-22 08:57:57,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:57:57,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-10-22 08:57:57,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-10-22 08:57:57,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:57:57,803 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 08:57:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-10-22 08:57:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-22 08:57:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 08:57:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-10-22 08:57:57,804 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 08:57:57,805 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-10-22 08:57:57,805 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:57:57,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-10-22 08:57:57,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:57:57,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:57:57,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:57:57,806 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 08:57:57,806 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:57:57,806 INFO L791 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 301#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 302#L559-2 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; 309#L555-1 [2019-10-22 08:57:57,806 INFO L793 eck$LassoCheckResult]: Loop: 309#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 304#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 305#L556 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 312#L559 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 308#L559-2 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; 309#L555-1 [2019-10-22 08:57:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2019-10-22 08:57:57,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551588143] [2019-10-22 08:57:57,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,828 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,829 INFO L82 PathProgramCache]: Analyzing trace with hash 40270557, now seen corresponding path program 1 times [2019-10-22 08:57:57,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744614532] [2019-10-22 08:57:57,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,843 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 179598362, now seen corresponding path program 1 times [2019-10-22 08:57:57,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590743661] [2019-10-22 08:57:57,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:57:57,875 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:57:58,283 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-10-22 08:57:58,607 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-10-22 08:57:58,609 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:57:58,609 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:57:58,609 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:57:58,609 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:57:58,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:57:58,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:57:58,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:57:58,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:57:58,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca.i_Iteration4_Lasso [2019-10-22 08:57:58,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:57:58,610 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:57:58,616 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:57:58,622 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:57:58,625 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:57:58,626 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:57:58,628 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:57:58,639 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:57:58,640 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:57:58,643 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:57:58,646 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:57:58,648 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:57:58,649 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:57:58,651 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:57:58,653 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:57:58,655 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:57:59,242 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-10-22 08:57:59,328 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:57:59,958 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-10-22 08:57:59,985 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:57:59,985 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:57:59,986 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:57:59,987 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:59,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:59,987 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:59,988 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:59,988 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:59,988 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:59,988 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:59,989 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:59,989 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:57:59,990 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:59,990 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:59,990 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:59,990 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:59,990 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:59,990 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:59,990 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:59,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:59,992 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:57:59,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:59,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:59,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:59,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:59,993 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:57:59,993 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:57:59,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:59,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 08:57:59,996 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:59,996 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:57:59,996 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:59,996 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:59,996 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:59,997 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:57:59,997 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:57:59,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:57:59,998 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:57:59,998 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:57:59,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:57:59,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:57:59,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:57:59,999 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,000 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,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 08:58:00,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,003 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,004 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,004 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,005 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:00,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,006 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,006 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,007 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:00,008 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,008 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,008 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,008 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,009 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,009 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,011 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:00,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,012 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,012 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,014 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:00,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,014 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,015 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,015 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,016 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:00,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,016 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,018 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,018 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,020 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:00,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,021 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,022 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,024 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:00,024 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,025 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:00,025 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,025 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,025 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,026 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:00,026 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:00,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,027 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:00,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,028 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,028 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,030 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,031 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:00,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,034 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,035 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,049 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:00,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,050 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:58:00,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,052 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:58:00,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,064 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:00,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,066 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,066 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,067 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:00,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,076 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:00,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,078 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,084 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:00,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,086 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,087 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:00,097 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:00,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:00,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:00,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:00,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:00,099 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:00,099 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:00,111 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:00,118 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:00,121 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:00,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:00,123 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:00,123 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:00,123 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2019-10-22 08:58:00,214 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-10-22 08:58:00,215 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:58:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:00,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:00,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:00,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:58:00,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-10-22 08:58:00,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:58:00,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:58:00,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:58:00,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-10-22 08:58:00,368 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:00,368 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:00,369 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-10-22 08:58:00,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 31 states and 38 transitions. Complement of second has 8 states. [2019-10-22 08:58:00,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:58:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-10-22 08:58:00,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 5 letters. [2019-10-22 08:58:00,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:00,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2019-10-22 08:58:00,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:00,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 10 letters. [2019-10-22 08:58:00,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:00,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-10-22 08:58:00,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:00,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2019-10-22 08:58:00,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:58:00,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:58:00,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-10-22 08:58:00,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:00,436 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-22 08:58:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-10-22 08:58:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-10-22 08:58:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-22 08:58:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-10-22 08:58:00,443 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-10-22 08:58:00,443 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-10-22 08:58:00,443 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:58:00,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2019-10-22 08:58:00,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:00,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:00,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:00,444 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:58:00,445 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:00,445 INFO L791 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, 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_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 489#L559-2 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; 511#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 491#L555-3 [2019-10-22 08:58:00,445 INFO L793 eck$LassoCheckResult]: Loop: 491#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 492#L556 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 499#L559 assume !(test_fun_#t~mem10 > 0);havoc test_fun_#t~mem10; 495#L559-2 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; 496#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 491#L555-3 [2019-10-22 08:58:00,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,445 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-10-22 08:58:00,445 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8590052] [2019-10-22 08:58:00,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,446 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,467 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,470 INFO L82 PathProgramCache]: Analyzing trace with hash 45964859, now seen corresponding path program 1 times [2019-10-22 08:58:00,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172909989] [2019-10-22 08:58:00,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:00,483 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1272583860, now seen corresponding path program 1 times [2019-10-22 08:58:00,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914007513] [2019-10-22 08:58:00,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:00,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914007513] [2019-10-22 08:58:00,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:00,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:00,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574977216] [2019-10-22 08:58:00,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:00,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:00,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:00,604 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-10-22 08:58:00,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:00,627 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-10-22 08:58:00,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:00,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2019-10-22 08:58:00,629 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:00,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-10-22 08:58:00,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:00,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:00,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:00,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:00,630 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:00,630 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:00,630 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:00,630 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:58:00,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:00,630 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:00,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:00,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:00 BoogieIcfgContainer [2019-10-22 08:58:00,636 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:00,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:00,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:00,637 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:00,637 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:54" (3/4) ... [2019-10-22 08:58:00,641 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:00,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:00,643 INFO L168 Benchmark]: Toolchain (without parser) took 7285.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 939.3 MB in the beginning and 978.9 MB in the end (delta: -39.6 MB). Peak memory consumption was 261.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:00,643 INFO L168 Benchmark]: CDTParser took 0.24 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 08:58:00,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:00,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.86 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:00,645 INFO L168 Benchmark]: Boogie Preprocessor took 26.34 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:00,645 INFO L168 Benchmark]: RCFGBuilder took 321.87 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: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:00,646 INFO L168 Benchmark]: BuchiAutomizer took 6337.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 978.9 MB in the end (delta: 111.4 MB). Peak memory consumption was 272.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:00,646 INFO L168 Benchmark]: Witness Printer took 5.09 ms. Allocated memory is still 1.3 GB. Free memory is still 978.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:00,649 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.24 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 549.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.86 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. * Boogie Preprocessor took 26.34 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 321.87 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: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6337.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 161.0 MB). Free memory was 1.1 GB in the beginning and 978.9 MB in the end (delta: 111.4 MB). Peak memory consumption was 272.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.09 ms. Allocated memory is still 1.3 GB. Free memory is still 978.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 5.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 35 SDtfs, 51 SDslu, 34 SDs, 0 SdLazy, 108 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital358 mio100 ax105 hnf99 lsp73 ukn85 mio100 lsp23 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf402 smp91 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 6 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...