./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7464e7c5283b85fe14cc907bcd5d5339a700ef74 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:07:46,428 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:07:46,429 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:07:46,436 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:07:46,436 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:07:46,437 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:07:46,438 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:07:46,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:07:46,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:07:46,440 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:07:46,441 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:07:46,441 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:07:46,442 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:07:46,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:07:46,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:07:46,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:07:46,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:07:46,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:07:46,447 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:07:46,448 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:07:46,449 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:07:46,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:07:46,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:07:46,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:07:46,451 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:07:46,452 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:07:46,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:07:46,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:07:46,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:07:46,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:07:46,455 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:07:46,455 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:07:46,456 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:07:46,456 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:07:46,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:07:46,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:07:46,457 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 06:07:46,468 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:07:46,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:07:46,469 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:07:46,469 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:07:46,469 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:07:46,470 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:07:46,470 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:07:46,470 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:07:46,470 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:07:46,470 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:07:46,470 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:07:46,470 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:07:46,471 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:07:46,471 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:07:46,471 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:07:46,471 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:07:46,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:07:46,471 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:07:46,471 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:07:46,471 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:07:46,472 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:07:46,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:07:46,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:07:46,472 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:07:46,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:07:46,472 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:07:46,472 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:07:46,473 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:07:46,473 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7464e7c5283b85fe14cc907bcd5d5339a700ef74 [2018-11-10 06:07:46,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:07:46,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:07:46,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:07:46,508 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:07:46,508 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:07:46,509 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-10 06:07:46,548 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/data/47a3bfd99/f1bfc19591c94088a2cf26526d3cc761/FLAGcf7da3d68 [2018-11-10 06:07:46,992 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:07:46,993 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-10 06:07:47,003 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/data/47a3bfd99/f1bfc19591c94088a2cf26526d3cc761/FLAGcf7da3d68 [2018-11-10 06:07:47,014 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/uautomizer/data/47a3bfd99/f1bfc19591c94088a2cf26526d3cc761 [2018-11-10 06:07:47,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:07:47,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:07:47,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:07:47,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:07:47,019 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:07:47,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6604a2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47, skipping insertion in model container [2018-11-10 06:07:47,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:07:47,055 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:07:47,235 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:07:47,244 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:07:47,272 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:07:47,300 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:07:47,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47 WrapperNode [2018-11-10 06:07:47,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:07:47,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:07:47,301 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:07:47,301 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:07:47,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:07:47,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:07:47,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:07:47,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:07:47,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... [2018-11-10 06:07:47,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:07:47,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:07:47,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:07:47,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:07:47,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2cca734b-2acc-496d-8533-bb1f0e3450ab/bin-2019/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 [2018-11-10 06:07:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 06:07:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 06:07:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:07:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:07:47,700 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:07:47,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:07:47 BoogieIcfgContainer [2018-11-10 06:07:47,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:07:47,701 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:07:47,701 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:07:47,704 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:07:47,705 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:07:47,705 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:07:47" (1/3) ... [2018-11-10 06:07:47,706 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66763f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:07:47, skipping insertion in model container [2018-11-10 06:07:47,706 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:07:47,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:07:47" (2/3) ... [2018-11-10 06:07:47,706 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66763f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:07:47, skipping insertion in model container [2018-11-10 06:07:47,706 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:07:47,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:07:47" (3/3) ... [2018-11-10 06:07:47,708 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-10 06:07:47,749 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:07:47,749 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:07:47,749 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:07:47,750 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:07:47,750 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:07:47,750 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:07:47,750 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:07:47,750 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:07:47,750 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:07:47,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 06:07:47,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 06:07:47,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:07:47,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:07:47,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:07:47,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:07:47,786 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:07:47,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2018-11-10 06:07:47,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 06:07:47,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:07:47,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:07:47,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:07:47,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:07:47,794 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 25#L553true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 28#L553-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 24#L554true SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 8#L555true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 14#L558-6true [2018-11-10 06:07:47,794 INFO L795 eck$LassoCheckResult]: Loop: 14#L558-6true assume true; 4#L557true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6#L557-1true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 9#L557-2true test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 10#L557-3true assume !test_fun_#t~short10; 32#L557-8true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 12#L558-5true assume !true; 14#L558-6true [2018-11-10 06:07:47,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:47,799 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 1 times [2018-11-10 06:07:47,800 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:47,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:47,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:47,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:47,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1911060026, now seen corresponding path program 1 times [2018-11-10 06:07:47,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:47,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:47,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:47,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:47,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:07:47,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:07:47,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:07:47,974 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:07:47,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:07:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:07:47,986 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-11-10 06:07:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:07:48,026 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-10 06:07:48,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:07:48,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-11-10 06:07:48,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 06:07:48,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 25 states and 26 transitions. [2018-11-10 06:07:48,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 06:07:48,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 06:07:48,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-11-10 06:07:48,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:07:48,033 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 06:07:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-11-10 06:07:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-10 06:07:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 06:07:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-10 06:07:48,052 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 06:07:48,052 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 06:07:48,052 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:07:48,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2018-11-10 06:07:48,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 06:07:48,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:07:48,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:07:48,054 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:07:48,054 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:07:48,054 INFO L793 eck$LassoCheckResult]: Stem: 93#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 82#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 83#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 91#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 90#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 78#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 79#L558-6 [2018-11-10 06:07:48,054 INFO L795 eck$LassoCheckResult]: Loop: 79#L558-6 assume true; 75#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 76#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 77#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 80#L557-3 assume test_fun_#t~short10; 81#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-4 92#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-5 94#L557-6 test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 95#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 84#L558-5 assume true; 85#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 88#L558-2 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 89#L558-3 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 79#L558-6 [2018-11-10 06:07:48,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 2 times [2018-11-10 06:07:48,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:48,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:48,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1306359397, now seen corresponding path program 1 times [2018-11-10 06:07:48,094 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:48,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:48,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:07:48,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:07:48,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:07:48,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 06:07:48,254 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:07:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 06:07:48,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-10 06:07:48,255 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 12 states. [2018-11-10 06:07:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:07:48,533 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-10 06:07:48,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 06:07:48,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 32 transitions. [2018-11-10 06:07:48,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 06:07:48,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 32 transitions. [2018-11-10 06:07:48,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-10 06:07:48,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-10 06:07:48,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 32 transitions. [2018-11-10 06:07:48,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:07:48,537 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-10 06:07:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 32 transitions. [2018-11-10 06:07:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-10 06:07:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 06:07:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-10 06:07:48,541 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-10 06:07:48,541 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-10 06:07:48,542 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:07:48,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 30 transitions. [2018-11-10 06:07:48,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 06:07:48,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:07:48,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:07:48,543 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:07:48,543 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:07:48,544 INFO L793 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 170#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 179#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 178#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 165#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 166#L558-6 [2018-11-10 06:07:48,544 INFO L795 eck$LassoCheckResult]: Loop: 166#L558-6 assume true; 162#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 163#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 164#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 167#L557-3 assume test_fun_#t~short10; 168#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-4 180#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-5 182#L557-6 test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 183#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 185#L558-5 assume true; 187#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 176#L558-2 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 177#L558-3 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 173#L559 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 159#L559-1 SUMMARY for call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 160#L559-2 havoc test_fun_#t~mem13; 161#L560 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 184#L560-1 SUMMARY for call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 174#L560-2 havoc test_fun_#t~mem14; 171#L558-5 assume true; 172#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 175#L558-2 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 186#L558-3 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 166#L558-6 [2018-11-10 06:07:48,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:48,544 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 3 times [2018-11-10 06:07:48,551 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:48,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:48,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:48,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash -263171291, now seen corresponding path program 1 times [2018-11-10 06:07:48,583 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:48,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:07:48,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:48,611 INFO L82 PathProgramCache]: Analyzing trace with hash 116447137, now seen corresponding path program 1 times [2018-11-10 06:07:48,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:48,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:48,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:48,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:48,807 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2018-11-10 06:07:49,173 WARN L179 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 121 [2018-11-10 06:07:49,306 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-10 06:07:49,314 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:07:49,315 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:07:49,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:07:49,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:07:49,316 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:07:49,316 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:07:49,316 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:07:49,316 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:07:49,316 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 06:07:49,316 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:07:49,317 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:07:49,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,875 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 129 [2018-11-10 06:07:49,988 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2018-11-10 06:07:49,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:49,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:50,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:50,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:50,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:50,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:50,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:50,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:50,208 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-10 06:07:50,526 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:07:50,530 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:07:50,532 INFO L122 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 [2018-11-10 06:07:50,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:50,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:50,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:50,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:50,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:50,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:50,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:50,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:50,537 INFO L122 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 [2018-11-10 06:07:50,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:50,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:50,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:50,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:50,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:50,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:50,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:50,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:50,539 INFO L122 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 [2018-11-10 06:07:50,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:50,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:50,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:50,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:50,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:50,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:50,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:50,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:50,541 INFO L122 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 [2018-11-10 06:07:50,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:50,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:50,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:50,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:50,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:07:50,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:07:50,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:50,547 INFO L122 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 [2018-11-10 06:07:50,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:50,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:50,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:50,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:50,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:50,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:50,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:50,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:50,550 INFO L122 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 [2018-11-10 06:07:50,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:50,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:50,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:50,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:50,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:07:50,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:07:50,587 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:07:50,603 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:07:50,604 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:07:50,606 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:07:50,607 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:07:50,607 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:07:50,608 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-10 06:07:50,739 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 06:07:50,744 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:07:50,745 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:07:50,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:50,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:50,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:50,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 51 [2018-11-10 06:07:50,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 35 treesize of output 31 [2018-11-10 06:07:50,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:51,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 35 treesize of output 31 [2018-11-10 06:07:51,080 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:51,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 43 [2018-11-10 06:07:51,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-11-10 06:07:51,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 43 [2018-11-10 06:07:51,281 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-11-10 06:07:51,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-10 06:07:51,442 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 06:07:51,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 39 treesize of output 35 [2018-11-10 06:07:51,523 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:51,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 [2018-11-10 06:07:51,584 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:51,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-11-10 06:07:51,645 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-10 06:07:51,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 21 [2018-11-10 06:07:51,700 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:51,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2018-11-10 06:07:51,770 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 8 xjuncts. [2018-11-10 06:07:51,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 21 [2018-11-10 06:07:51,814 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:51,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-10 06:07:51,846 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-10 06:07:51,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-10 06:07:51,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:07:51,885 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-11-10 06:07:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 06:07:51,984 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-10 06:07:51,985 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 30 transitions. cyclomatic complexity: 2 Second operand 13 states. [2018-11-10 06:07:52,514 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 30 transitions. cyclomatic complexity: 2. Second operand 13 states. Result 56 states and 59 transitions. Complement of second has 30 states. [2018-11-10 06:07:52,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2018-11-10 06:07:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 06:07:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2018-11-10 06:07:52,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 32 transitions. Stem has 6 letters. Loop has 23 letters. [2018-11-10 06:07:52,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:07:52,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 32 transitions. Stem has 29 letters. Loop has 23 letters. [2018-11-10 06:07:52,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:07:52,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 32 transitions. Stem has 6 letters. Loop has 46 letters. [2018-11-10 06:07:52,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:07:52,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 59 transitions. [2018-11-10 06:07:52,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 06:07:52,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 56 states and 59 transitions. [2018-11-10 06:07:52,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 06:07:52,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-10 06:07:52,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 59 transitions. [2018-11-10 06:07:52,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:07:52,521 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-11-10 06:07:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 59 transitions. [2018-11-10 06:07:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-11-10 06:07:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 06:07:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-10 06:07:52,523 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-10 06:07:52,523 INFO L608 BuchiCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-10 06:07:52,523 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:07:52,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 51 transitions. [2018-11-10 06:07:52,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 06:07:52,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:07:52,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:07:52,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:07:52,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:07:52,525 INFO L793 eck$LassoCheckResult]: Stem: 593#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 573#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 574#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 590#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 589#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 567#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 568#L558-6 assume true; 561#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 562#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 565#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 569#L557-3 assume test_fun_#t~short10; 571#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-4 591#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-5 594#L557-6 test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 596#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9; 575#L558-5 [2018-11-10 06:07:52,525 INFO L795 eck$LassoCheckResult]: Loop: 575#L558-5 assume true; 576#L558-1 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 584#L558-2 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 586#L558-3 assume !!(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 580#L559 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 555#L559-1 SUMMARY for call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 556#L559-2 havoc test_fun_#t~mem13; 559#L560 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560 598#L560-1 SUMMARY for call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L560-1 582#L560-2 havoc test_fun_#t~mem14; 575#L558-5 [2018-11-10 06:07:52,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:52,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1550544334, now seen corresponding path program 1 times [2018-11-10 06:07:52,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:52,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:52,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:52,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:52,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:52,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1891189557, now seen corresponding path program 1 times [2018-11-10 06:07:52,550 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:52,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:52,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:52,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:52,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1215101508, now seen corresponding path program 1 times [2018-11-10 06:07:52,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:07:52,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:07:52,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:52,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:07:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:07:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:07:53,022 WARN L179 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 136 [2018-11-10 06:07:53,163 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-10 06:07:53,166 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:07:53,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:07:53,166 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:07:53,166 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:07:53,166 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:07:53,166 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:07:53,166 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:07:53,166 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:07:53,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-10 06:07:53,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:07:53,167 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:07:53,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,562 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 129 [2018-11-10 06:07:53,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:53,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:07:54,141 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:07:54,141 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:07:54,141 INFO L122 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 [2018-11-10 06:07:54,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:54,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:07:54,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:54,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:54,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:54,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:07:54,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:07:54,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:54,144 INFO L122 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 [2018-11-10 06:07:54,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:54,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:54,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:54,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:54,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:07:54,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:07:54,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:54,150 INFO L122 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 [2018-11-10 06:07:54,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:54,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:54,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:54,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:54,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:07:54,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:07:54,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:54,153 INFO L122 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 [2018-11-10 06:07:54,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:54,153 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:07:54,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:54,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:54,154 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:07:54,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:07:54,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:54,159 INFO L122 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 [2018-11-10 06:07:54,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:54,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:54,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:54,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:54,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:07:54,160 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:07:54,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:07:54,162 INFO L122 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 [2018-11-10 06:07:54,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:07:54,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:07:54,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:07:54,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:07:54,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:07:54,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:07:54,177 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:07:54,185 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 06:07:54,185 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:07:54,185 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:07:54,186 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:07:54,186 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:07:54,186 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-10 06:07:54,285 INFO L297 tatePredicateManager]: 35 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 06:07:54,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:07:54,287 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:07:54,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:07:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:54,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:54,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2018-11-10 06:07:54,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 15 treesize of output 13 [2018-11-10 06:07:54,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:54,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2018-11-10 06:07:54,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:54,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2018-11-10 06:07:54,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:54,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:54,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:54,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-10 06:07:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:07:54,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:07:54,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:54,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 77 [2018-11-10 06:07:54,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-11-10 06:07:54,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:54,590 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:54,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-11-10 06:07:54,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:54,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:54,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 59 [2018-11-10 06:07:54,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-10 06:07:54,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:07:54,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:07:54,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:105 [2018-11-10 06:07:54,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:54,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-11-10 06:07:54,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 06:07:54,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:54,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:07:54,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:54,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 66 [2018-11-10 06:07:54,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-11-10 06:07:54,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:54,843 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:54,844 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:54,846 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:07:54,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 59 [2018-11-10 06:07:54,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 06:07:54,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:07:54,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 06:07:54,888 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:104, output treesize:93 [2018-11-10 06:07:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:07:54,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 8 loop predicates [2018-11-10 06:07:54,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 51 transitions. cyclomatic complexity: 5 Second operand 14 states. [2018-11-10 06:07:55,216 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 51 transitions. cyclomatic complexity: 5. Second operand 14 states. Result 107 states and 114 transitions. Complement of second has 21 states. [2018-11-10 06:07:55,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 6 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 06:07:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 06:07:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2018-11-10 06:07:55,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 36 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 06:07:55,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:07:55,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 36 transitions. Stem has 25 letters. Loop has 10 letters. [2018-11-10 06:07:55,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:07:55,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 36 transitions. Stem has 15 letters. Loop has 20 letters. [2018-11-10 06:07:55,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:07:55,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 114 transitions. [2018-11-10 06:07:55,221 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:07:55,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 0 states and 0 transitions. [2018-11-10 06:07:55,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 06:07:55,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 06:07:55,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 06:07:55,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:07:55,222 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:07:55,222 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:07:55,222 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:07:55,222 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:07:55,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:07:55,222 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:07:55,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 06:07:55,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:07:55 BoogieIcfgContainer [2018-11-10 06:07:55,228 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:07:55,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:07:55,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:07:55,228 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:07:55,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:07:47" (3/4) ... [2018-11-10 06:07:55,231 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 06:07:55,232 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:07:55,232 INFO L168 Benchmark]: Toolchain (without parser) took 8215.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.5 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 211.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:55,233 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:07:55,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.12 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 934.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:55,233 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -230.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:55,234 INFO L168 Benchmark]: Boogie Preprocessor took 16.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:07:55,234 INFO L168 Benchmark]: RCFGBuilder took 310.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:55,234 INFO L168 Benchmark]: BuchiAutomizer took 7526.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. [2018-11-10 06:07:55,235 INFO L168 Benchmark]: Witness Printer took 3.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:07:55,237 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.12 ms. Allocated memory is still 1.0 GB. Free memory was 955.5 MB in the beginning and 934.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -230.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 310.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7526.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.8 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 16 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 14 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.3s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 72 SDtfs, 127 SDslu, 137 SDs, 0 SdLazy, 297 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital434 mio100 ax104 hnf100 lsp94 ukn67 mio100 lsp37 div100 bol100 ite100 ukn100 eq203 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 VariablesLoop: 2 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...