./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.15-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_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/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 7464e7c5283b85fe14cc907bcd5d5339a700ef74 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:54:11,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:11,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:11,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:11,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:11,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:11,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:11,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:11,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:11,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:11,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:11,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:11,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:11,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:11,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:11,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:11,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:11,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:11,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:11,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:11,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:11,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:11,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:11,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:11,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:11,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:11,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:11,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:11,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:11,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:11,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:11,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:11,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:11,194 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:11,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:11,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:11,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:11,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:11,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:11,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:11,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:11,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:54:11,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:11,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:11,210 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:11,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:11,211 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:11,211 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:54:11,211 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:54:11,211 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:54:11,211 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:54:11,211 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:54:11,212 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:54:11,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:11,212 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:11,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:11,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:11,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:54:11,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:54:11,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:54:11,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:11,213 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:54:11,214 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:11,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:54:11,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:11,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:11,215 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:54:11,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:11,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:11,215 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:54:11,216 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:54:11,216 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_fe8af74d-6ffb-495d-a47b-0307192d1026/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 -> 7464e7c5283b85fe14cc907bcd5d5339a700ef74 [2019-10-22 08:54:11,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:11,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:11,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:11,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:11,255 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:11,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2019-10-22 08:54:11,307 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/data/b95c623e9/646eb3c696a3457f8558f833144f61c4/FLAG6b8f9d074 [2019-10-22 08:54:11,761 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:11,761 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2019-10-22 08:54:11,775 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/data/b95c623e9/646eb3c696a3457f8558f833144f61c4/FLAG6b8f9d074 [2019-10-22 08:54:12,077 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/bin/uautomizer/data/b95c623e9/646eb3c696a3457f8558f833144f61c4 [2019-10-22 08:54:12,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:12,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:12,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:12,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:12,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24e88636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,093 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:12,122 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:12,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,451 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:12,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,528 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:12,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12 WrapperNode [2019-10-22 08:54:12,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:12,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:12,539 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:54:12" (1/1) ... [2019-10-22 08:54:12,556 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:54:12" (1/1) ... [2019-10-22 08:54:12,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:12,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:12,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:12,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:12,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:12,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe8af74d-6ffb-495d-a47b-0307192d1026/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:54:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:12,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:13,053 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:13,053 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:54:13,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:13 BoogieIcfgContainer [2019-10-22 08:54:13,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:13,055 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:54:13,055 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:54:13,060 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:54:13,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:13,061 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:54:12" (1/3) ... [2019-10-22 08:54:13,063 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f71358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:13, skipping insertion in model container [2019-10-22 08:54:13,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:13,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (2/3) ... [2019-10-22 08:54:13,064 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f71358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:54:13, skipping insertion in model container [2019-10-22 08:54:13,065 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:54:13,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:13" (3/3) ... [2019-10-22 08:54:13,067 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.15-alloca.i [2019-10-22 08:54:13,117 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:54:13,117 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:54:13,117 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:54:13,118 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:13,118 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:13,118 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:54:13,118 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:13,118 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:54:13,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:54:13,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:13,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,170 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:13,170 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:54:13,170 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:54:13,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-10-22 08:54:13,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:13,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,173 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:13,173 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:54:13,180 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~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L558-4true [2019-10-22 08:54:13,181 INFO L793 eck$LassoCheckResult]: Loop: 13#L558-4true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 14#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~short10; 11#L558-3true assume !true; 13#L558-4true [2019-10-22 08:54:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 08:54:13,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582797778] [2019-10-22 08:54:13,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,412 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2019-10-22 08:54:13,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816297212] [2019-10-22 08:54:13,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,449 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:54:13,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816297212] [2019-10-22 08:54:13,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-10-22 08:54:13,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653719147] [2019-10-22 08:54:13,453 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:13,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:54:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:54:13,466 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-10-22 08:54:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,471 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-10-22 08:54:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:54:13,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-10-22 08:54:13,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:13,476 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2019-10-22 08:54:13,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:54:13,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:54:13,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2019-10-22 08:54:13,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:13,479 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:54:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2019-10-22 08:54:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-10-22 08:54:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-10-22 08:54:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-10-22 08:54:13,503 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:54:13,503 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-10-22 08:54:13,504 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:54:13,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-10-22 08:54:13,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:54:13,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,505 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:13,505 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:13,505 INFO L791 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L558-4 [2019-10-22 08:54:13,505 INFO L793 eck$LassoCheckResult]: Loop: 33#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 37#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 38#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~short10; 36#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11; 33#L558-4 [2019-10-22 08:54:13,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 08:54:13,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280381739] [2019-10-22 08:54:13,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,588 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,589 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2019-10-22 08:54:13,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830673728] [2019-10-22 08:54:13,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,738 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:54:13,738 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830673728] [2019-10-22 08:54:13,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:13,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901534404] [2019-10-22 08:54:13,739 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:54:13,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:13,740 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-10-22 08:54:13,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:13,858 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-10-22 08:54:13,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:13,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-10-22 08:54:13,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:13,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 12 transitions. [2019-10-22 08:54:13,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:54:13,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:54:13,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2019-10-22 08:54:13,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:13,861 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-10-22 08:54:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2019-10-22 08:54:13,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-10-22 08:54:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-10-22 08:54:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-10-22 08:54:13,862 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:54:13,862 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-10-22 08:54:13,862 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:54:13,863 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2019-10-22 08:54:13,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-10-22 08:54:13,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:13,863 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:13,863 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 08:54:13,863 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-10-22 08:54:13,864 INFO L791 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 64#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 65#L558-4 [2019-10-22 08:54:13,866 INFO L793 eck$LassoCheckResult]: Loop: 65#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 69#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 70#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~short10; 72#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 67#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 68#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 71#L558-1 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11; 65#L558-4 [2019-10-22 08:54:13,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,866 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 08:54:13,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95243163] [2019-10-22 08:54:13,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,922 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2019-10-22 08:54:13,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200390174] [2019-10-22 08:54:13,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:13,972 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2019-10-22 08:54:13,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134121202] [2019-10-22 08:54:13,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:14,055 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:14,261 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-10-22 08:54:14,948 WARN L191 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-10-22 08:54:15,194 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-22 08:54:15,212 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:15,213 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:15,213 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:15,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:15,213 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:15,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:15,214 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:15,214 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:15,214 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca.i_Iteration3_Lasso [2019-10-22 08:54:15,214 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:15,214 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:15,239 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:54:15,245 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:54:15,247 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:54:15,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,258 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:54:15,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:54:15,267 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:54:15,270 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:54:15,273 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:54:15,278 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:54:15,281 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:54:15,893 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2019-10-22 08:54:16,041 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-10-22 08:54:16,041 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:54:16,043 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:54:16,045 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:54:16,047 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:54:16,050 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:54:16,052 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:54:16,053 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:54:16,056 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:54:17,254 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 08:54:17,307 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:17,314 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:17,317 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:54:17,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,319 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,320 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,320 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,322 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,322 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,325 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:54:17,326 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,326 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,328 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,328 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,329 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:54:17,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,331 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,331 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,337 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:54:17,338 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,338 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,339 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,340 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,341 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:54:17,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,342 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,343 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,347 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:54:17,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,349 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,349 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,352 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,355 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,358 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,359 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:54:17,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,361 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,361 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,363 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,363 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,365 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:54:17,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,367 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,368 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,371 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,372 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,376 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:54:17,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,377 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,377 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,378 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,380 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,388 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:54:17,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,389 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,389 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,391 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,391 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,394 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:54:17,395 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,395 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:17,395 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,396 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:17,396 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:17,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,398 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:54:17,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,400 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,401 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,405 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:54:17,405 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,406 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,406 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,407 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,407 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:17,410 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:54:17,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:17,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:17,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:17,411 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:17,416 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:17,416 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:17,462 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:17,511 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:17,511 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:54:17,521 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:17,523 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:17,523 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:17,524 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2019-10-22 08:54:17,687 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-10-22 08:54:17,696 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:54:17,697 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:54:17,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:17,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:54:17,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:17,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:54:17,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:17,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:17,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2019-10-22 08:54:17,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:54:17,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-22 08:54:17,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:17,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 08:54:17,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2019-10-22 08:54:17,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:54:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:17,901 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:54:17,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 6 states. [2019-10-22 08:54:18,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 16 states and 21 transitions. Complement of second has 10 states. [2019-10-22 08:54:18,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 08:54:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-10-22 08:54:18,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 7 letters. [2019-10-22 08:54:18,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 9 letters. Loop has 7 letters. [2019-10-22 08:54:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 14 letters. [2019-10-22 08:54:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:18,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. [2019-10-22 08:54:18,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:18,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2019-10-22 08:54:18,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:54:18,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:54:18,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-10-22 08:54:18,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:18,065 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-10-22 08:54:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-10-22 08:54:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-10-22 08:54:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:54:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-10-22 08:54:18,066 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:54:18,066 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-10-22 08:54:18,066 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:54:18,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-10-22 08:54:18,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:18,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:18,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:18,067 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:18,068 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:18,068 INFO L791 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 298#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 299#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 305#L557-1 assume !test_fun_#t~short10; 306#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~short10; 302#L558-3 [2019-10-22 08:54:18,068 INFO L793 eck$LassoCheckResult]: Loop: 302#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 301#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 302#L558-3 [2019-10-22 08:54:18,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:18,069 INFO L82 PathProgramCache]: Analyzing trace with hash 28695850, now seen corresponding path program 1 times [2019-10-22 08:54:18,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:18,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971587734] [2019-10-22 08:54:18,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:18,086 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:54:18,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971587734] [2019-10-22 08:54:18,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:18,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:18,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336992176] [2019-10-22 08:54:18,086 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:54:18,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2019-10-22 08:54:18,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:18,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006970507] [2019-10-22 08:54:18,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,096 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:18,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:18,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:18,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:18,163 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-10-22 08:54:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:18,174 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-10-22 08:54:18,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:18,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2019-10-22 08:54:18,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:18,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 17 transitions. [2019-10-22 08:54:18,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:54:18,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:54:18,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2019-10-22 08:54:18,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:54:18,177 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:54:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2019-10-22 08:54:18,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:54:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:54:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-10-22 08:54:18,178 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:54:18,178 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-10-22 08:54:18,178 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:54:18,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2019-10-22 08:54:18,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 08:54:18,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:54:18,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:54:18,179 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:54:18,179 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 08:54:18,179 INFO L791 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 334#L-1 havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 335#L558-4 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 341#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 342#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~short10; 338#L558-3 [2019-10-22 08:54:18,180 INFO L793 eck$LassoCheckResult]: Loop: 338#L558-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 337#L558-1 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 338#L558-3 [2019-10-22 08:54:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:18,182 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2019-10-22 08:54:18,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:18,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095832018] [2019-10-22 08:54:18,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,226 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2019-10-22 08:54:18,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:18,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249331721] [2019-10-22 08:54:18,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,238 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:18,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:18,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849233, now seen corresponding path program 1 times [2019-10-22 08:54:18,239 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:18,239 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656123352] [2019-10-22 08:54:18,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:18,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:18,271 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:18,963 WARN L191 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 125 [2019-10-22 08:54:19,166 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-10-22 08:54:19,168 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:54:19,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:54:19,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:54:19,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:54:19,169 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:54:19,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:54:19,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:54:19,169 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:54:19,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca.i_Iteration5_Lasso [2019-10-22 08:54:19,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:54:19,169 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:54:19,171 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:54:19,177 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:54:19,179 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:54:19,182 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:54:19,183 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:54:19,185 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:54:19,188 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:54:19,190 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:54:19,191 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:54:19,193 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:54:19,198 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:54:19,201 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:54:19,203 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:54:19,205 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:54:19,208 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:54:19,209 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:54:19,210 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:54:19,211 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:54:19,213 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:54:19,701 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2019-10-22 08:54:20,930 WARN L191 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 08:54:20,946 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:54:20,946 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:54:20,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,947 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,948 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,949 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,951 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:54:20,951 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,952 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,952 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,952 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,953 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:54:20,954 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,954 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,956 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,956 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,958 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:54:20,959 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,959 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,959 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,960 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,961 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:54:20,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,962 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,962 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,962 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,962 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,963 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,963 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,964 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:54:20,965 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,965 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,966 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,966 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,968 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,970 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,970 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,971 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:54:20,972 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,972 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,972 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,972 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,973 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,973 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,973 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,974 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:54:20,974 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,974 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,975 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,975 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,975 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:20,977 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,977 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,977 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,977 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,978 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,978 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,979 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:54:20,979 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,981 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,981 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,983 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:54:20,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,984 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,984 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,985 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:54:20,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,986 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,987 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,988 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:54:20,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,990 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:20,990 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:20,992 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,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:54:20,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,993 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,993 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,993 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,993 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,993 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,993 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,994 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:54:20,995 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,995 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,995 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,995 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,995 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,995 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,996 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,997 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:54:20,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:20,998 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:54:20,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:20,998 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:20,998 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:20,998 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:54:20,998 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:54:20,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:20,999 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:54:21,000 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,000 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,000 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,000 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,001 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,001 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,004 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:54:21,005 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,005 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,006 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,006 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 08:54:21,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,009 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,010 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,010 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,015 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:54:21,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,016 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,016 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,017 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,017 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,021 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:54:21,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,025 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,025 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,041 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:54:21,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,043 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,043 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,045 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:54:21,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,046 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,046 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,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:54:21,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,050 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,050 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,052 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:54:21,052 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,053 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,054 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,054 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,059 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:54:21,059 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,060 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,061 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,061 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:54:21,065 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:54:21,066 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:54:21,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:54:21,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:54:21,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:54:21,068 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:54:21,069 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:54:21,083 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:54:21,097 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:54:21,097 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 08:54:21,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:54:21,098 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:54:21,098 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:54:21,099 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, 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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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:54:21,254 INFO L297 tatePredicateManager]: 39 out of 41 supporting invariants were superfluous and have been removed [2019-10-22 08:54:21,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:54:21,257 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 08:54:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:21,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:54:21,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:21,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:54:21,322 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:54:21,322 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2019-10-22 08:54:21,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:54:21,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:54:21,346 INFO L567 ElimStorePlain]: treesize reduction 1, result has 94.4 percent of original size [2019-10-22 08:54:21,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 08:54:21,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:17 [2019-10-22 08:54:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:21,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:54:21,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:21,401 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:54:21,401 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-10-22 08:54:21,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-10-22 08:54:21,509 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 32 states and 37 transitions. Complement of second has 8 states. [2019-10-22 08:54:21,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:54:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:54:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2019-10-22 08:54:21,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2019-10-22 08:54:21,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:21,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-10-22 08:54:21,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:21,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 12 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 08:54:21,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:54:21,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2019-10-22 08:54:21,512 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:21,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-10-22 08:54:21,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:54:21,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:54:21,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:54:21,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:54:21,513 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:21,513 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:21,513 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:21,513 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:54:21,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:21,513 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:54:21,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:54:21,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:54:21 BoogieIcfgContainer [2019-10-22 08:54:21,520 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:54:21,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:21,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:21,520 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:21,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:13" (3/4) ... [2019-10-22 08:54:21,523 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:21,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:21,524 INFO L168 Benchmark]: Toolchain (without parser) took 9443.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 335.0 MB). Free memory was 944.5 MB in the beginning and 1.0 GB in the end (delta: -58.6 MB). Peak memory consumption was 276.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,524 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:21,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 447.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,525 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,526 INFO L168 Benchmark]: Boogie Preprocessor took 33.83 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:54:21,526 INFO L168 Benchmark]: RCFGBuilder took 445.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.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,527 INFO L168 Benchmark]: BuchiAutomizer took 8465.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.4 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:21,527 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:21,529 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 447.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 445.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.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8465.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.4 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 34 SDtfs, 18 SDslu, 19 SDs, 0 SdLazy, 64 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital443 mio100 ax104 hnf100 lsp94 ukn53 mio100 lsp32 div100 bol100 ite100 ukn100 eq191 hnf88 smp97 dnf693 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...