./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/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_5c687285-5f44-49d8-9bc2-1f40cb79cae4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/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-635dfa2 [2018-12-02 22:36:39,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:36:39,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:36:39,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:36:39,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:36:39,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:36:39,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:36:39,334 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:36:39,335 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:36:39,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:36:39,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:36:39,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:36:39,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:36:39,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:36:39,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:36:39,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:36:39,339 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:36:39,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:36:39,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:36:39,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:36:39,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:36:39,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:36:39,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:36:39,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:36:39,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:36:39,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:36:39,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:36:39,346 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:36:39,346 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:36:39,347 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:36:39,347 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:36:39,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:36:39,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:36:39,348 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:36:39,348 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:36:39,349 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:36:39,349 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 22:36:39,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:36:39,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:36:39,357 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 22:36:39,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 22:36:39,358 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 22:36:39,358 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 22:36:39,358 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 22:36:39,358 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 22:36:39,358 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 22:36:39,358 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 22:36:39,358 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 22:36:39,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 22:36:39,359 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 22:36:39,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:36:39,360 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:36:39,360 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 22:36:39,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:36:39,360 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 22:36:39,360 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 22:36:39,360 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 22:36:39,361 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_5c687285-5f44-49d8-9bc2-1f40cb79cae4/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-12-02 22:36:39,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:36:39,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:36:39,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:36:39,390 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:36:39,390 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:36:39,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2018-12-02 22:36:39,434 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/bin-2019/uautomizer/data/c0ffe34a4/e1d0a2a56a084805b71e0ae5d61abc32/FLAGdd5fc8046 [2018-12-02 22:36:39,837 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:36:39,838 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/sv-benchmarks/c/termination-memory-alloca/b.16-alloca_true-termination_true-no-overflow.c.i [2018-12-02 22:36:39,844 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/bin-2019/uautomizer/data/c0ffe34a4/e1d0a2a56a084805b71e0ae5d61abc32/FLAGdd5fc8046 [2018-12-02 22:36:39,852 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/bin-2019/uautomizer/data/c0ffe34a4/e1d0a2a56a084805b71e0ae5d61abc32 [2018-12-02 22:36:39,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:36:39,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:36:39,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:36:39,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:36:39,856 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:36:39,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:36:39" (1/1) ... [2018-12-02 22:36:39,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3263b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:39, skipping insertion in model container [2018-12-02 22:36:39,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:36:39" (1/1) ... [2018-12-02 22:36:39,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:36:39,880 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:36:40,019 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:36:40,025 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:36:40,079 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:36:40,099 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:36:40,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40 WrapperNode [2018-12-02 22:36:40,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:36:40,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:36:40,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:36:40,100 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:36:40,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... [2018-12-02 22:36:40,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... [2018-12-02 22:36:40,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:36:40,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:36:40,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:36:40,124 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:36:40,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... [2018-12-02 22:36:40,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... [2018-12-02 22:36:40,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... [2018-12-02 22:36:40,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... [2018-12-02 22:36:40,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... [2018-12-02 22:36:40,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... [2018-12-02 22:36:40,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... [2018-12-02 22:36:40,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:36:40,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:36:40,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:36:40,138 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:36:40,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c687285-5f44-49d8-9bc2-1f40cb79cae4/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-12-02 22:36:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 22:36:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 22:36:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 22:36:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 22:36:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:36:40,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:36:40,286 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:36:40,286 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 22:36:40,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:36:40 BoogieIcfgContainer [2018-12-02 22:36:40,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:36:40,287 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 22:36:40,287 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 22:36:40,290 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 22:36:40,291 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 22:36:40,291 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 10:36:39" (1/3) ... [2018-12-02 22:36:40,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b0ab16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:36:40, skipping insertion in model container [2018-12-02 22:36:40,292 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 22:36:40,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:36:40" (2/3) ... [2018-12-02 22:36:40,292 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b0ab16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:36:40, skipping insertion in model container [2018-12-02 22:36:40,292 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 22:36:40,292 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:36:40" (3/3) ... [2018-12-02 22:36:40,293 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.16-alloca_true-termination_true-no-overflow.c.i [2018-12-02 22:36:40,323 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 22:36:40,323 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 22:36:40,324 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 22:36:40,324 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 22:36:40,324 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:36:40,324 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:36:40,324 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 22:36:40,324 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:36:40,324 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 22:36:40,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-02 22:36:40,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 22:36:40,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:36:40,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:36:40,348 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 22:36:40,348 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 22:36:40,348 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 22:36:40,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-12-02 22:36:40,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 22:36:40,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:36:40,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:36:40,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 22:36:40,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 22:36:40,354 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-12-02 22:36:40,354 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-12-02 22:36:40,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:40,358 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 22:36:40,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:36:40,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:36:40,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:40,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:40,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:40,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-12-02 22:36:40,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:36:40,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:36:40,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:40,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:40,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:36:40,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 22:36:40,468 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 22:36:40,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 22:36:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 22:36:40,480 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-12-02 22:36:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:36:40,484 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-12-02 22:36:40,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 22:36:40,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-12-02 22:36:40,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 22:36:40,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-12-02 22:36:40,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 22:36:40,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 22:36:40,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-12-02 22:36:40,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 22:36:40,490 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 22:36:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-12-02 22:36:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-02 22:36:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 22:36:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-02 22:36:40,506 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 22:36:40,506 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 22:36:40,507 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 22:36:40,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-12-02 22:36:40,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 22:36:40,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:36:40,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:36:40,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 22:36:40,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 22:36:40,508 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-12-02 22:36:40,508 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-12-02 22:36:40,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:40,508 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 22:36:40,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:36:40,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:36:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:40,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:40,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-12-02 22:36:40,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:36:40,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:36:40,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:36:40,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:40,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:40,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-12-02 22:36:40,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:36:40,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:36:40,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:40,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:40,808 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-02 22:36:40,886 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 22:36:40,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 22:36:40,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 22:36:40,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 22:36:40,887 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 22:36:40,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:36:40,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 22:36:40,888 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 22:36:40,888 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-12-02 22:36:40,888 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 22:36:40,888 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 22:36:40,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:40,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:40,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:40,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:40,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,065 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-12-02 22:36:41,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:41,398 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 22:36:41,400 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 22:36:41,402 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-12-02 22:36:41,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:36:41,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:36:41,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:36:41,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,406 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-12-02 22:36:41,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:36:41,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:36:41,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:36:41,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,407 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-12-02 22:36:41,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:36:41,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:36:41,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:36:41,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,409 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-12-02 22:36:41,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:36:41,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:36:41,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:36:41,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,411 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-12-02 22:36:41,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:41,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:41,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,417 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-12-02 22:36:41,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:41,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:41,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,423 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-12-02 22:36:41,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:41,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:41,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,428 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-12-02 22:36:41,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,429 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:36:41,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,431 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:36:41,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:41,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,437 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-12-02 22:36:41,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:41,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:41,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,441 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-12-02 22:36:41,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:41,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:41,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,466 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-12-02 22:36:41,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,467 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:36:41,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,469 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:36:41,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:41,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:41,475 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-12-02 22:36:41,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:41,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:41,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:41,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:41,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:41,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:41,489 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 22:36:41,494 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 22:36:41,494 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 22:36:41,496 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 22:36:41,497 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 22:36:41,498 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 22:36:41,498 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-12-02 22:36:41,544 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-12-02 22:36:41,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 22:36:41,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:41,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:36:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:41,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:36:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:41,611 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-12-02 22:36:41,612 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-12-02 22:36:41,659 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-12-02 22:36:41,659 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-12-02 22:36:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 22:36:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-12-02 22:36:41,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 5 letters. [2018-12-02 22:36:41,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:36:41,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 7 letters. Loop has 5 letters. [2018-12-02 22:36:41,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:36:41,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 10 letters. [2018-12-02 22:36:41,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:36:41,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2018-12-02 22:36:41,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 22:36:41,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 25 transitions. [2018-12-02 22:36:41,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 22:36:41,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 22:36:41,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-12-02 22:36:41,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 22:36:41,665 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-12-02 22:36:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-12-02 22:36:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-02 22:36:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 22:36:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-02 22:36:41,666 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 22:36:41,666 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 22:36:41,666 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 22:36:41,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-02 22:36:41,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 22:36:41,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:36:41,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:36:41,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 22:36:41,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-02 22:36:41,668 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-12-02 22:36:41,668 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-12-02 22:36:41,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 22:36:41,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:36:41,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:36:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:41,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:41,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:41,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash 15492128, now seen corresponding path program 1 times [2018-12-02 22:36:41,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:36:41,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:36:41,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:41,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:41,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:41,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:41,690 INFO L82 PathProgramCache]: Analyzing trace with hash 765526557, now seen corresponding path program 1 times [2018-12-02 22:36:41,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:36:41,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:36:41,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:41,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:36:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:36:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:36:41,984 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2018-12-02 22:36:42,064 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 22:36:42,064 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 22:36:42,064 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 22:36:42,064 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 22:36:42,064 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 22:36:42,064 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:36:42,064 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 22:36:42,064 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 22:36:42,064 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.16-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-02 22:36:42,064 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 22:36:42,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 22:36:42,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:36:42,511 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 22:36:42,511 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 22:36:42,511 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-12-02 22:36:42,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:36:42,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:36:42,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:36:42,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,514 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-12-02 22:36:42,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:36:42,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:36:42,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:36:42,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,515 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-12-02 22:36:42,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:36:42,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:36:42,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:36:42,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,516 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-12-02 22:36:42,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:42,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,518 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-12-02 22:36:42,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:42,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,521 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-12-02 22:36:42,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:42,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,525 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-12-02 22:36:42,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,525 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:36:42,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,526 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:36:42,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,529 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-12-02 22:36:42,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:42,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,531 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-12-02 22:36:42,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:42,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,533 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-12-02 22:36:42,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,533 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:36:42,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,534 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:36:42,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,536 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-12-02 22:36:42,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:42,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,540 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-12-02 22:36:42,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,540 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:36:42,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,541 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:36:42,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,543 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-12-02 22:36:42,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:42,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:36:42,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:36:42,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:36:42,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:36:42,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:36:42,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:36:42,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:36:42,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:36:42,551 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 22:36:42,554 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 22:36:42,554 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 22:36:42,554 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 22:36:42,554 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 22:36:42,555 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 22:36:42,555 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-12-02 22:36:42,603 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-12-02 22:36:42,604 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 22:36:42,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:36:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:42,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:36:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:36:42,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:36:42,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:36:42,650 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-12-02 22:36:42,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:36:42,654 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-12-02 22:36:42,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:36:42,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:36:42,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 22:36:42,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-12-02 22:36:42,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:36:42,685 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-12-02 22:36:42,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:36:42,690 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-12-02 22:36:42,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 22:36:42,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 22:36:42,714 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-12-02 22:36:42,715 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-02 22:36:42,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 22:36:42,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 22:36:42,746 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:37 [2018-12-02 22:36:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:36:42,756 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-12-02 22:36:42,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-12-02 22:36:42,768 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-12-02 22:36:42,769 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-12-02 22:36:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 22:36:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-02 22:36:42,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 7 letters. [2018-12-02 22:36:42,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:36:42,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 7 letters. [2018-12-02 22:36:42,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:36:42,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 14 letters. [2018-12-02 22:36:42,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:36:42,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2018-12-02 22:36:42,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 22:36:42,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-12-02 22:36:42,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 22:36:42,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 22:36:42,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 22:36:42,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 22:36:42,772 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:36:42,772 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:36:42,772 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:36:42,772 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 22:36:42,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 22:36:42,772 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 22:36:42,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 22:36:42,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 10:36:42 BoogieIcfgContainer [2018-12-02 22:36:42,776 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 22:36:42,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 22:36:42,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 22:36:42,777 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 22:36:42,777 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:36:40" (3/4) ... [2018-12-02 22:36:42,780 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 22:36:42,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 22:36:42,780 INFO L168 Benchmark]: Toolchain (without parser) took 2926.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 956.0 MB in the beginning and 915.3 MB in the end (delta: 40.7 MB). Peak memory consumption was 252.5 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:42,781 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:36:42,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:42,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:36:42,782 INFO L168 Benchmark]: Boogie Preprocessor took 13.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:36:42,782 INFO L168 Benchmark]: RCFGBuilder took 148.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:42,782 INFO L168 Benchmark]: BuchiAutomizer took 2489.46 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 915.3 MB in the end (delta: 165.7 MB). Peak memory consumption was 261.7 MB. Max. memory is 11.5 GB. [2018-12-02 22:36:42,783 INFO L168 Benchmark]: Witness Printer took 3.00 ms. Allocated memory is still 1.2 GB. Free memory is still 915.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:36:42,785 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 148.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2489.46 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 915.3 MB in the end (delta: 165.7 MB). Peak memory consumption was 261.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.00 ms. Allocated memory is still 1.2 GB. Free memory is still 915.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.0s. 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...