./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 27b51ff95b1c87aada11269295eff3fc5c30957f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:03:02,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:03:02,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:03:02,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:03:02,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:03:02,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:03:02,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:03:02,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:03:02,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:03:02,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:03:02,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:03:02,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:03:02,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:03:02,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:03:02,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:03:02,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:03:02,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:03:02,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:03:02,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:03:02,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:03:02,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:03:02,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:03:02,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:03:02,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:03:02,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:03:02,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:03:02,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:03:02,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:03:02,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:03:02,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:03:02,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:03:02,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:03:02,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:03:02,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:03:02,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:03:02,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:03:02,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:03:02,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:03:02,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:03:02,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:03:02,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:03:02,295 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:03:02,312 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:03:02,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:03:02,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:03:02,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:03:02,314 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:03:02,314 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:03:02,314 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:03:02,314 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:03:02,315 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:03:02,315 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:03:02,315 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:03:02,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:03:02,315 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:03:02,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:03:02,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:03:02,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:03:02,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:03:02,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:03:02,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:03:02,317 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:03:02,317 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:03:02,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:03:02,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:03:02,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:03:02,318 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:03:02,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:03:02,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:03:02,319 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:03:02,320 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:03:02,320 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27b51ff95b1c87aada11269295eff3fc5c30957f [2019-11-16 00:03:02,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:03:02,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:03:02,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:03:02,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:03:02,365 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:03:02,366 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2019-11-16 00:03:02,449 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/data/cbf6e36b1/dc14378e05a646dbb2cbc319172182dc/FLAGe061cffee [2019-11-16 00:03:02,894 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:03:02,894 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/sv-benchmarks/c/termination-memory-alloca/b.12-alloca.i [2019-11-16 00:03:02,918 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/data/cbf6e36b1/dc14378e05a646dbb2cbc319172182dc/FLAGe061cffee [2019-11-16 00:03:03,181 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/data/cbf6e36b1/dc14378e05a646dbb2cbc319172182dc [2019-11-16 00:03:03,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:03:03,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:03:03,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:03,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:03:03,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:03:03,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d69c462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03, skipping insertion in model container [2019-11-16 00:03:03,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,202 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:03:03,253 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:03:03,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:03,613 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:03:03,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:03,716 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:03:03,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03 WrapperNode [2019-11-16 00:03:03,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:03,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:03,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:03:03,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:03:03,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:03,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:03:03,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:03:03,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:03:03,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,779 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... [2019-11-16 00:03:03,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:03:03,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:03:03,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:03:03,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:03:03,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_29908251-be42-4dc4-8a6f-a7c2a682e19f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:03,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:03:03,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:03:03,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:03:03,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:03:03,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:03:03,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:03:04,189 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:03:04,190 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:03:04,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:04 BoogieIcfgContainer [2019-11-16 00:03:04,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:03:04,191 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:03:04,191 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:03:04,194 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:03:04,195 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:03:04,195 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:03:03" (1/3) ... [2019-11-16 00:03:04,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f6e878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:03:04, skipping insertion in model container [2019-11-16 00:03:04,196 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:03:04,196 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:03" (2/3) ... [2019-11-16 00:03:04,196 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f6e878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:03:04, skipping insertion in model container [2019-11-16 00:03:04,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:03:04,197 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:04" (3/3) ... [2019-11-16 00:03:04,198 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.12-alloca.i [2019-11-16 00:03:04,240 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:03:04,240 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:03:04,240 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:03:04,241 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:03:04,241 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:03:04,241 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:03:04,241 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:03:04,241 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:03:04,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-16 00:03:04,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:03:04,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:04,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:04,286 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:03:04,286 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:04,286 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:03:04,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-16 00:03:04,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:03:04,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:04,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:04,289 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:03:04,289 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:04,297 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7#L559-2true [2019-11-16 00:03:04,298 INFO L793 eck$LassoCheckResult]: Loop: 7#L559-2true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 13#L555-1true assume test_fun_#t~short7; 5#L555-3true assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 8#L556true assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 7#L559-2true [2019-11-16 00:03:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-16 00:03:04,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:04,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423761856] [2019-11-16 00:03:04,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:04,495 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:04,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:04,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2019-11-16 00:03:04,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:04,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092153218] [2019-11-16 00:03:04,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:04,522 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:04,524 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-11-16 00:03:04,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:04,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816107179] [2019-11-16 00:03:04,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:04,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:04,747 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-16 00:03:05,358 WARN L191 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 85 [2019-11-16 00:03:05,571 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-16 00:03:05,584 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:05,585 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:05,585 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:05,586 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:05,586 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:05,586 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:05,586 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:05,587 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:05,587 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca.i_Iteration1_Lasso [2019-11-16 00:03:05,587 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:05,587 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:05,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,038 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-16 00:03:06,149 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-11-16 00:03:06,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,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-11-16 00:03:06,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-11-16 00:03:06,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:06,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-11-16 00:03:06,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-11-16 00:03:06,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-11-16 00:03:06,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-11-16 00:03:06,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-11-16 00:03:07,278 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-16 00:03:07,354 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:07,359 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:07,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:07,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:07,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:07,365 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:07,365 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:07,370 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:07,371 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:07,378 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:07,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:07,380 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:07,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:07,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:07,380 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:07,385 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:07,385 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:07,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:07,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:07,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:07,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:07,401 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:07,401 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:07,404 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:07,404 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:07,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:07,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-11-16 00:03:07,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:07,411 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:07,411 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:07,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:07,414 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:07,414 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:07,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:07,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:07,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:07,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:07,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:07,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:07,423 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:07,423 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:07,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:07,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:07,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:07,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:07,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:07,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:07,432 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:07,432 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:07,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:07,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:07,437 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:07,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:07,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:07,438 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:07,441 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:07,441 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:07,464 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:07,486 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-16 00:03:07,486 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:03:07,489 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:07,490 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:03:07,491 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:07,491 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-11-16 00:03:07,553 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2019-11-16 00:03:07,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:03:07,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:07,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:07,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:07,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:03:07,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:07,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:07,740 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:03:07,741 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2019-11-16 00:03:07,865 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 50 states and 67 transitions. Complement of second has 9 states. [2019-11-16 00:03:07,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:03:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2019-11-16 00:03:07,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-16 00:03:07,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:07,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:03:07,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:07,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-16 00:03:07,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:07,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 67 transitions. [2019-11-16 00:03:07,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:03:07,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 25 states and 39 transitions. [2019-11-16 00:03:07,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:03:07,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:03:07,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 39 transitions. [2019-11-16 00:03:07,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:07,886 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 39 transitions. [2019-11-16 00:03:07,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 39 transitions. [2019-11-16 00:03:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-16 00:03:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-16 00:03:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2019-11-16 00:03:07,919 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2019-11-16 00:03:07,919 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2019-11-16 00:03:07,919 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:03:07,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 37 transitions. [2019-11-16 00:03:07,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:03:07,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:07,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:07,922 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:03:07,922 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:03:07,922 INFO L791 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 187#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 188#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 195#L555-1 [2019-11-16 00:03:07,922 INFO L793 eck$LassoCheckResult]: Loop: 195#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 190#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 191#L556 assume test_fun_#t~mem8 > 0;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem9; 194#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 195#L555-1 [2019-11-16 00:03:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-16 00:03:07,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:07,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668217942] [2019-11-16 00:03:07,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:07,966 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:07,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2019-11-16 00:03:07,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:07,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765139081] [2019-11-16 00:03:07,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:07,985 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2019-11-16 00:03:07,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:07,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404402578] [2019-11-16 00:03:07,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:07,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:08,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404402578] [2019-11-16 00:03:08,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:08,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764099656] [2019-11-16 00:03:08,247 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-16 00:03:08,476 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-11-16 00:03:08,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:08,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:08,481 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-16 00:03:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:08,559 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2019-11-16 00:03:08,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:08,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. [2019-11-16 00:03:08,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2019-11-16 00:03:08,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 39 transitions. [2019-11-16 00:03:08,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-16 00:03:08,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-16 00:03:08,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2019-11-16 00:03:08,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:08,578 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-16 00:03:08,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2019-11-16 00:03:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 14. [2019-11-16 00:03:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:03:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-11-16 00:03:08,581 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-16 00:03:08,581 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-11-16 00:03:08,582 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:03:08,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-11-16 00:03:08,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:03:08,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:08,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:08,583 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:03:08,583 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:03:08,584 INFO L791 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 261#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 262#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 269#L555-1 [2019-11-16 00:03:08,584 INFO L793 eck$LassoCheckResult]: Loop: 269#L555-1 assume test_fun_#t~short7; 264#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 265#L556 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 272#L559 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 268#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 269#L555-1 [2019-11-16 00:03:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,584 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-11-16 00:03:08,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721881941] [2019-11-16 00:03:08,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,642 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash 38423515, now seen corresponding path program 1 times [2019-11-16 00:03:08,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054692529] [2019-11-16 00:03:08,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,680 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:08,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash 177751320, now seen corresponding path program 1 times [2019-11-16 00:03:08,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744616174] [2019-11-16 00:03:08,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,682 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:08,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744616174] [2019-11-16 00:03:08,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,722 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:08,722 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457642089] [2019-11-16 00:03:08,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:08,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:08,833 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 5 states. [2019-11-16 00:03:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:08,859 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-11-16 00:03:08,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:08,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2019-11-16 00:03:08,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:03:08,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 15 transitions. [2019-11-16 00:03:08,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:03:08,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:03:08,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-11-16 00:03:08,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:08,862 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-16 00:03:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-11-16 00:03:08,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-16 00:03:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-16 00:03:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-11-16 00:03:08,864 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-16 00:03:08,864 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-11-16 00:03:08,864 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:03:08,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2019-11-16 00:03:08,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:03:08,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:08,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:08,865 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:03:08,865 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:03:08,865 INFO L791 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 301#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 302#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 309#L555-1 [2019-11-16 00:03:08,865 INFO L793 eck$LassoCheckResult]: Loop: 309#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 304#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 305#L556 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 312#L559 assume test_fun_#t~mem10 > 0;havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 308#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 309#L555-1 [2019-11-16 00:03:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,865 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2019-11-16 00:03:08,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508141289] [2019-11-16 00:03:08,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,893 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,894 INFO L82 PathProgramCache]: Analyzing trace with hash 40270557, now seen corresponding path program 1 times [2019-11-16 00:03:08,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8982466] [2019-11-16 00:03:08,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,911 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,912 INFO L82 PathProgramCache]: Analyzing trace with hash 179598362, now seen corresponding path program 1 times [2019-11-16 00:03:08,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132232885] [2019-11-16 00:03:08,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:08,952 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:09,071 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-11-16 00:03:09,564 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 96 [2019-11-16 00:03:10,036 WARN L191 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-16 00:03:10,039 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:03:10,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:03:10,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:03:10,040 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:03:10,040 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:03:10,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:03:10,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:03:10,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:03:10,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.12-alloca.i_Iteration4_Lasso [2019-11-16 00:03:10,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:03:10,040 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:03:10,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:10,985 WARN L191 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-11-16 00:03:11,121 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-16 00:03:11,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:03:12,005 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-16 00:03:12,043 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:03:12,043 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:03:12,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,045 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:12,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,046 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:12,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:12,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:12,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,049 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:12,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:12,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,052 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,056 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:12,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,057 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:12,057 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:12,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,059 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,060 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,060 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,064 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:12,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,065 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:12,065 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:12,066 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,067 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,067 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:12,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,068 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:12,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:12,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,072 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,072 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:12,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:12,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:12,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:12,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:12,080 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:12,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,082 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,083 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,083 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,088 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,088 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:03:12,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:03:12,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:03:12,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,094 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,094 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,096 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,096 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,100 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,103 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,104 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,120 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,121 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,121 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:03:12,122 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,122 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,124 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:03:12,124 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,130 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,130 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,134 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,134 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,137 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,139 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,139 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,144 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,146 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,146 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,151 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:03:12,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:03:12,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:03:12,152 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:03:12,152 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:03:12,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:03:12,154 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:03:12,154 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:03:12,163 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:03:12,167 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:03:12,171 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:03:12,171 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:03:12,173 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:03:12,173 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:03:12,177 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2019-11-16 00:03:12,258 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2019-11-16 00:03:12,259 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:03:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:12,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:03:12,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:12,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:12,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-16 00:03:12,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:03:12,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:03:12,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:03:12,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-16 00:03:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:12,428 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-16 00:03:12,429 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-11-16 00:03:12,505 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 31 states and 38 transitions. Complement of second has 8 states. [2019-11-16 00:03:12,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:03:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:03:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-11-16 00:03:12,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 5 letters. [2019-11-16 00:03:12,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:12,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-16 00:03:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:12,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 3 letters. Loop has 10 letters. [2019-11-16 00:03:12,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:03:12,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-16 00:03:12,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:03:12,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2019-11-16 00:03:12,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-16 00:03:12,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:03:12,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-11-16 00:03:12,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:03:12,510 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-16 00:03:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-11-16 00:03:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-11-16 00:03:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-16 00:03:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-11-16 00:03:12,516 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-16 00:03:12,516 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-11-16 00:03:12,517 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:03:12,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2019-11-16 00:03:12,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:03:12,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:03:12,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:03:12,518 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:03:12,518 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:03:12,519 INFO L791 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 488#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~short7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 489#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 511#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 491#L555-3 [2019-11-16 00:03:12,519 INFO L793 eck$LassoCheckResult]: Loop: 491#L555-3 assume !!test_fun_#t~short7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~short7;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 492#L556 assume !(test_fun_#t~mem8 > 0);havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 499#L559 assume !(test_fun_#t~mem10 > 0);havoc test_fun_#t~mem10; 495#L559-2 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem5 > 0; 496#L555-1 assume !test_fun_#t~short7;call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short7 := test_fun_#t~mem6 > 0; 491#L555-3 [2019-11-16 00:03:12,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-11-16 00:03:12,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102852471] [2019-11-16 00:03:12,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:12,541 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,542 INFO L82 PathProgramCache]: Analyzing trace with hash 45964859, now seen corresponding path program 1 times [2019-11-16 00:03:12,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216730546] [2019-11-16 00:03:12,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:12,554 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1272583860, now seen corresponding path program 1 times [2019-11-16 00:03:12,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990769539] [2019-11-16 00:03:12,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:12,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990769539] [2019-11-16 00:03:12,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:12,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:12,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342432660] [2019-11-16 00:03:12,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:12,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:12,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:12,738 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-16 00:03:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:12,772 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-16 00:03:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:12,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2019-11-16 00:03:12,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:03:12,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2019-11-16 00:03:12,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:03:12,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:03:12,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:03:12,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:03:12,775 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:03:12,775 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:03:12,775 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:03:12,775 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:03:12,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:03:12,775 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:03:12,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:03:12,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:03:12 BoogieIcfgContainer [2019-11-16 00:03:12,783 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:03:12,783 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:03:12,783 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:03:12,783 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:03:12,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:04" (3/4) ... [2019-11-16 00:03:12,791 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:03:12,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:03:12,793 INFO L168 Benchmark]: Toolchain (without parser) took 9608.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.1 MB). Free memory was 939.4 MB in the beginning and 933.3 MB in the end (delta: 6.1 MB). Peak memory consumption was 311.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:12,794 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:03:12,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:12,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.59 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:12,802 INFO L168 Benchmark]: Boogie Preprocessor took 26.53 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-11-16 00:03:12,803 INFO L168 Benchmark]: RCFGBuilder took 397.77 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:12,804 INFO L168 Benchmark]: BuchiAutomizer took 8591.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 933.3 MB in the end (delta: 147.3 MB). Peak memory consumption was 325.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:12,804 INFO L168 Benchmark]: Witness Printer took 8.42 ms. Allocated memory is still 1.3 GB. Free memory is still 933.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:03:12,813 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 531.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.59 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.53 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 397.77 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: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8591.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 933.3 MB in the end (delta: 147.3 MB). Peak memory consumption was 325.0 MB. Max. memory is 11.5 GB. * Witness Printer took 8.42 ms. Allocated memory is still 1.3 GB. Free memory is still 933.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 7.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 35 SDtfs, 51 SDslu, 34 SDs, 0 SdLazy, 108 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital358 mio100 ax105 hnf99 lsp73 ukn85 mio100 lsp23 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf402 smp91 tf100 neg92 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 6 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...