./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/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 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:12:46,393 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:12:46,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:12:46,402 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:12:46,402 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:12:46,403 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:12:46,404 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:12:46,405 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:12:46,406 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:12:46,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:12:46,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:12:46,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:12:46,409 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:12:46,409 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:12:46,410 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:12:46,410 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:12:46,411 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:12:46,412 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:12:46,414 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:12:46,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:12:46,415 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:12:46,416 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:12:46,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:12:46,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:12:46,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:12:46,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:12:46,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:12:46,420 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:12:46,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:12:46,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:12:46,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:12:46,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:12:46,422 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:12:46,422 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:12:46,423 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:12:46,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:12:46,424 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 12:12:46,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:12:46,434 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:12:46,435 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:12:46,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:12:46,436 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:12:46,436 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:12:46,436 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:12:46,436 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:12:46,436 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:12:46,436 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:12:46,436 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:12:46,437 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:12:46,437 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:12:46,437 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:12:46,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:12:46,437 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:12:46,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:12:46,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:12:46,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:12:46,437 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:12:46,438 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:12:46,438 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:12:46,438 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:12:46,438 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:12:46,438 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:12:46,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:12:46,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:12:46,438 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:12:46,439 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:12:46,439 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_e6b77c96-2902-4260-b074-8e8bdea84f39/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 -> 59be66e49b54b8b00b9c1d5bff1f6857d45f8bbd [2018-11-28 12:12:46,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:12:46,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:12:46,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:12:46,472 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:12:46,472 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:12:46,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2018-11-28 12:12:46,510 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/data/8075ce7ec/b8f860fbdc9a4aceb9fc4cd1f47e0106/FLAG780a4ccef [2018-11-28 12:12:46,925 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:12:46,925 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2018-11-28 12:12:46,931 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/data/8075ce7ec/b8f860fbdc9a4aceb9fc4cd1f47e0106/FLAG780a4ccef [2018-11-28 12:12:46,939 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/bin-2019/uautomizer/data/8075ce7ec/b8f860fbdc9a4aceb9fc4cd1f47e0106 [2018-11-28 12:12:46,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:12:46,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:12:46,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:12:46,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:12:46,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:12:46,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:12:46" (1/1) ... [2018-11-28 12:12:46,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72ef766b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:46, skipping insertion in model container [2018-11-28 12:12:46,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:12:46" (1/1) ... [2018-11-28 12:12:46,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:12:46,976 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:12:47,143 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:12:47,152 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:12:47,216 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:12:47,247 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:12:47,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47 WrapperNode [2018-11-28 12:12:47,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:12:47,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:12:47,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:12:47,248 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:12:47,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... [2018-11-28 12:12:47,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... [2018-11-28 12:12:47,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:12:47,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:12:47,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:12:47,276 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:12:47,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... [2018-11-28 12:12:47,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... [2018-11-28 12:12:47,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... [2018-11-28 12:12:47,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... [2018-11-28 12:12:47,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... [2018-11-28 12:12:47,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... [2018-11-28 12:12:47,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... [2018-11-28 12:12:47,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:12:47,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:12:47,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:12:47,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:12:47,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e6b77c96-2902-4260-b074-8e8bdea84f39/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-28 12:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 12:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 12:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 12:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 12:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:12:47,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:12:47,528 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:12:47,528 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 12:12:47,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:12:47 BoogieIcfgContainer [2018-11-28 12:12:47,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:12:47,529 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:12:47,529 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:12:47,533 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:12:47,533 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:12:47,533 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:12:46" (1/3) ... [2018-11-28 12:12:47,534 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2361aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:12:47, skipping insertion in model container [2018-11-28 12:12:47,534 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:12:47,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:12:47" (2/3) ... [2018-11-28 12:12:47,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2361aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:12:47, skipping insertion in model container [2018-11-28 12:12:47,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:12:47,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:12:47" (3/3) ... [2018-11-28 12:12:47,537 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.16-alloca_true-termination_true-no-overflow.c.i [2018-11-28 12:12:47,575 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:12:47,575 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:12:47,576 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:12:47,576 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:12:47,576 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:12:47,576 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:12:47,576 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:12:47,576 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:12:47,576 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:12:47,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 12:12:47,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:12:47,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:12:47,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:12:47,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:12:47,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:12:47,608 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:12:47,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 12:12:47,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:12:47,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:12:47,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:12:47,609 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:12:47,609 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:12:47,614 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;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~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 7#L555-3true [2018-11-28 12:12:47,615 INFO L796 eck$LassoCheckResult]: Loop: 7#L555-3true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 14#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 5#L556-3true assume !true; 8#L556-4true call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 7#L555-3true [2018-11-28 12:12:47,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 12:12:47,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:12:47,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:12:47,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:12:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:47,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-11-28 12:12:47,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:12:47,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:12:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:12:47,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:12:47,761 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-28 12:12:47,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:12:47,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:12:47,765 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:12:47,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:12:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:12:47,776 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-28 12:12:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:12:47,780 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-28 12:12:47,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:12:47,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-28 12:12:47,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:12:47,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-11-28 12:12:47,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 12:12:47,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 12:12:47,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-28 12:12:47,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:12:47,788 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 12:12:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-28 12:12:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 12:12:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 12:12:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-28 12:12:47,810 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 12:12:47,810 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 12:12:47,810 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:12:47,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-28 12:12:47,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 12:12:47,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:12:47,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:12:47,812 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 12:12:47,812 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:12:47,812 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;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~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L555-3 [2018-11-28 12:12:47,812 INFO L796 eck$LassoCheckResult]: Loop: 33#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 37#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 34#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 38#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 33#L555-3 [2018-11-28 12:12:47,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:47,812 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 12:12:47,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:12:47,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:12:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:12:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:47,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-11-28 12:12:47,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:12:47,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:12:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:12:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:47,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:47,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-11-28 12:12:47,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:12:47,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:12:47,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:12:47,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:48,247 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-11-28 12:12:48,343 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:12:48,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:12:48,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:12:48,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:12:48,344 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:12:48,344 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:12:48,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:12:48,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:12:48,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-28 12:12:48,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:12:48,345 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:12:48,365 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-28 12:12:48,382 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-28 12:12:48,386 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-28 12:12:48,388 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-28 12:12:48,404 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-28 12:12:48,618 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-11-28 12:12:48,680 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-28 12:12:48,681 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-28 12:12:48,682 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-28 12:12:48,684 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-28 12:12:48,686 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-28 12:12:48,687 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-28 12:12:48,689 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-28 12:12:48,690 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-28 12:12:48,691 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-28 12:12:48,962 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:12:48,966 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:12:48,968 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-28 12:12:48,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:48,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:12:48,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:48,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:48,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:48,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:12:48,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:12:48,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:48,973 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-28 12:12:48,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:48,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:12:48,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:48,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:48,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:48,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:12:48,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:12:48,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:48,975 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-28 12:12:48,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:48,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:12:48,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:48,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:48,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:48,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:12:48,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:12:48,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:48,978 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-28 12:12:48,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:48,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:12:48,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:48,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:48,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:48,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:12:48,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:12:48,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:48,981 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-28 12:12:48,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:48,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:48,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:48,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:48,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:48,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:48,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:48,988 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-28 12:12:48,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:48,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:48,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:48,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:48,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:48,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:48,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:48,996 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-28 12:12:48,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:48,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:48,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:48,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:48,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:48,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:49,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:49,003 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-28 12:12:49,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:49,003 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:12:49,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:49,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:49,005 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:12:49,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:49,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:49,012 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-28 12:12:49,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:49,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:49,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:49,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:49,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:49,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:49,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:49,017 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-28 12:12:49,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:49,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:49,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:49,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:49,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:49,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:49,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:49,044 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-28 12:12:49,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:49,045 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:12:49,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:49,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:49,047 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:12:49,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:49,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:49,054 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-28 12:12:49,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:49,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:49,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:49,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:49,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:49,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:49,067 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:12:49,072 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:12:49,072 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:12:49,074 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:12:49,075 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:12:49,076 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:12:49,076 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-28 12:12:49,134 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-28 12:12:49,138 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:12:49,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:12:49,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:12:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:12:49,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:12:49,203 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-28 12:12:49,205 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:12:49,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-28 12:12:49,251 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 21 states and 26 transitions. Complement of second has 8 states. [2018-11-28 12:12:49,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:12:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:12:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-28 12:12:49,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-28 12:12:49,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:12:49,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-28 12:12:49,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:12:49,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-28 12:12:49,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:12:49,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-11-28 12:12:49,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:12:49,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 25 transitions. [2018-11-28 12:12:49,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 12:12:49,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 12:12:49,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-28 12:12:49,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:12:49,258 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 12:12:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-28 12:12:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-28 12:12:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 12:12:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-28 12:12:49,276 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 12:12:49,276 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-28 12:12:49,276 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:12:49,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-28 12:12:49,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 12:12:49,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:12:49,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:12:49,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:12:49,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-11-28 12:12:49,278 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 188#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~ret12;test_fun_#in~x, test_fun_#in~y := main_#t~nondet10, main_#t~nondet11;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~mem7, test_fun_#t~mem6, test_fun_#t~mem8, test_fun_#t~mem5, test_fun_#t~mem9, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 189#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2018-11-28 12:12:49,278 INFO L796 eck$LassoCheckResult]: Loop: 196#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 190#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 191#L556-1 assume !!(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem7 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem7; 201#L556-3 call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 203#L556-1 assume !(test_fun_#t~mem6 > 0);havoc test_fun_#t~mem6; 199#L556-4 call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem8 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem8; 195#L555-3 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 196#L555-1 [2018-11-28 12:12:49,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:49,279 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 12:12:49,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:12:49,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:12:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:49,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:12:49,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:49,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash 15492128, now seen corresponding path program 1 times [2018-11-28 12:12:49,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:12:49,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:12:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:49,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:12:49,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:49,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:49,308 INFO L82 PathProgramCache]: Analyzing trace with hash 765526557, now seen corresponding path program 1 times [2018-11-28 12:12:49,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:12:49,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:12:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:49,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:12:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:12:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:12:49,550 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-11-28 12:12:49,634 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:12:49,634 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:12:49,634 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:12:49,634 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:12:49,634 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:12:49,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:12:49,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:12:49,635 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:12:49,635 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 12:12:49,635 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:12:49,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:12:49,638 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-28 12:12:49,643 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-28 12:12:49,644 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-28 12:12:49,646 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-28 12:12:49,648 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-28 12:12:49,847 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-28 12:12:49,849 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-28 12:12:49,850 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-28 12:12:49,851 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-28 12:12:49,852 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-28 12:12:49,853 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-28 12:12:49,855 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-28 12:12:49,855 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-28 12:12:49,856 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-28 12:12:50,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:12:50,081 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:12:50,081 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-28 12:12:50,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:12:50,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:12:50,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:12:50,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,084 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-28 12:12:50,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:12:50,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:12:50,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:12:50,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,086 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-28 12:12:50,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:12:50,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:12:50,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:12:50,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,087 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-28 12:12:50,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:50,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,090 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-28 12:12:50,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:50,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,093 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-28 12:12:50,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:50,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,101 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-28 12:12:50,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,102 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:12:50,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,103 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:12:50,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,107 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-28 12:12:50,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:50,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,110 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-28 12:12:50,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:50,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,114 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-28 12:12:50,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,114 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:12:50,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,115 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:12:50,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,119 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-28 12:12:50,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:50,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,124 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-28 12:12:50,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:50,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,130 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-28 12:12:50,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,130 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 12:12:50,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,131 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 12:12:50,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:12:50,135 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-28 12:12:50,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:12:50,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:12:50,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:12:50,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:12:50,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 12:12:50,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 12:12:50,141 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:12:50,145 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:12:50,145 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:12:50,146 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:12:50,146 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 12:12:50,147 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:12:50,147 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-28 12:12:50,217 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-28 12:12:50,219 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 12:12:50,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:12:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:12:50,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:12:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:12:50,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:12:50,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:12:50,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 33 [2018-11-28 12:12:50,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:12:50,274 INFO L478 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 33 treesize of output 22 [2018-11-28 12:12:50,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:12:50,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:12:50,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 12:12:50,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-11-28 12:12:50,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:12:50,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 52 [2018-11-28 12:12:50,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:12:50,311 INFO L478 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 43 treesize of output 36 [2018-11-28 12:12:50,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 12:12:50,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 12:12:50,338 INFO L478 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 28 treesize of output 46 [2018-11-28 12:12:50,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-28 12:12:50,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 12:12:50,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 12:12:50,379 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:37 [2018-11-28 12:12:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:12:50,393 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 12:12:50,394 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-28 12:12:50,411 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 37 states and 46 transitions. Complement of second has 6 states. [2018-11-28 12:12:50,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:12:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:12:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 12:12:50,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 7 letters. [2018-11-28 12:12:50,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:12:50,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-28 12:12:50,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:12:50,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 14 letters. [2018-11-28 12:12:50,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:12:50,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2018-11-28 12:12:50,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:12:50,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-11-28 12:12:50,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 12:12:50,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 12:12:50,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 12:12:50,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:12:50,415 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:12:50,415 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:12:50,415 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:12:50,416 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:12:50,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:12:50,416 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 12:12:50,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 12:12:50,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:12:50 BoogieIcfgContainer [2018-11-28 12:12:50,421 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:12:50,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:12:50,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:12:50,421 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:12:50,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:12:47" (3/4) ... [2018-11-28 12:12:50,425 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:12:50,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:12:50,425 INFO L168 Benchmark]: Toolchain (without parser) took 3483.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.7 MB). Free memory was 950.6 MB in the beginning and 927.4 MB in the end (delta: 23.3 MB). Peak memory consumption was 265.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:12:50,426 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:12:50,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -207.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:12:50,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 12:12:50,427 INFO L168 Benchmark]: Boogie Preprocessor took 14.80 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-28 12:12:50,427 INFO L168 Benchmark]: RCFGBuilder took 237.53 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:12:50,428 INFO L168 Benchmark]: BuchiAutomizer took 2891.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 927.4 MB in the end (delta: 202.8 MB). Peak memory consumption was 275.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:12:50,428 INFO L168 Benchmark]: Witness Printer took 3.53 ms. Allocated memory is still 1.3 GB. Free memory is still 927.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:12:50,431 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -207.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.80 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 237.53 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2891.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 927.4 MB in the end (delta: 202.8 MB). Peak memory consumption was 275.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.53 ms. Allocated memory is still 1.3 GB. Free memory is still 927.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/2 HoareTripleCheckerStatistics: 20 SDtfs, 10 SDslu, 5 SDs, 0 SdLazy, 30 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital282 mio100 ax106 hnf100 lsp91 ukn60 mio100 lsp34 div100 bol100 ite100 ukn100 eq188 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 2 VariablesLoop: 0 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...