./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/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 df4500f5696d99ca846c8b1d02ff521622ca4836 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:06:20,167 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:06:20,168 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:06:20,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:06:20,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:06:20,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:06:20,176 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:06:20,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:06:20,178 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:06:20,179 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:06:20,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:06:20,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:06:20,180 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:06:20,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:06:20,182 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:06:20,182 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:06:20,182 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:06:20,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:06:20,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:06:20,186 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:06:20,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:06:20,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:06:20,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:06:20,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:06:20,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:06:20,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:06:20,189 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:06:20,190 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:06:20,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:06:20,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:06:20,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:06:20,192 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:06:20,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:06:20,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:06:20,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:06:20,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:06:20,194 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:06:20,201 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:06:20,201 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:06:20,202 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:06:20,202 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:06:20,202 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:06:20,202 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:06:20,202 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:06:20,203 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:06:20,203 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:06:20,203 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:06:20,203 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:06:20,203 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:06:20,203 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:06:20,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:06:20,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:06:20,204 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:06:20,204 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:06:20,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:06:20,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:06:20,204 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:06:20,204 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:06:20,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:06:20,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:06:20,205 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:06:20,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:06:20,205 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:06:20,205 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:06:20,205 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:06:20,205 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_2753114d-bce4-4b09-b40b-006720baa0ef/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 -> df4500f5696d99ca846c8b1d02ff521622ca4836 [2018-11-10 12:06:20,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:06:20,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:06:20,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:06:20,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:06:20,240 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:06:20,241 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:06:20,286 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/data/3485b30ed/1d0dc6372df34760a006caea51e940b8/FLAG79b6f9678 [2018-11-10 12:06:20,732 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:06:20,732 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/sv-benchmarks/c/termination-memory-alloca/a.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:06:20,741 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/data/3485b30ed/1d0dc6372df34760a006caea51e940b8/FLAG79b6f9678 [2018-11-10 12:06:20,750 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/data/3485b30ed/1d0dc6372df34760a006caea51e940b8 [2018-11-10 12:06:20,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:06:20,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:06:20,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:06:20,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:06:20,757 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:06:20,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:06:20" (1/1) ... [2018-11-10 12:06:20,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4f6b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:20, skipping insertion in model container [2018-11-10 12:06:20,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:06:20" (1/1) ... [2018-11-10 12:06:20,768 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:06:20,795 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:06:20,976 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:06:20,985 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:06:21,013 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:06:21,043 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:06:21,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21 WrapperNode [2018-11-10 12:06:21,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:06:21,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:06:21,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:06:21,044 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:06:21,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... [2018-11-10 12:06:21,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... [2018-11-10 12:06:21,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:06:21,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:06:21,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:06:21,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:06:21,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... [2018-11-10 12:06:21,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... [2018-11-10 12:06:21,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... [2018-11-10 12:06:21,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... [2018-11-10 12:06:21,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... [2018-11-10 12:06:21,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... [2018-11-10 12:06:21,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... [2018-11-10 12:06:21,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:06:21,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:06:21,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:06:21,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:06:21,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2753114d-bce4-4b09-b40b-006720baa0ef/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:06:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:06:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:06:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:06:21,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:06:21,387 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:06:21,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:06:21 BoogieIcfgContainer [2018-11-10 12:06:21,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:06:21,388 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:06:21,388 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:06:21,390 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:06:21,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:06:21,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:06:20" (1/3) ... [2018-11-10 12:06:21,391 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4692bfb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:06:21, skipping insertion in model container [2018-11-10 12:06:21,391 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:06:21,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:06:21" (2/3) ... [2018-11-10 12:06:21,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4692bfb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:06:21, skipping insertion in model container [2018-11-10 12:06:21,392 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:06:21,392 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:06:21" (3/3) ... [2018-11-10 12:06:21,393 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.09_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 12:06:21,432 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:06:21,433 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:06:21,433 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:06:21,433 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:06:21,433 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:06:21,433 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:06:21,433 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:06:21,433 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:06:21,433 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:06:21,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:06:21,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:06:21,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:06:21,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:06:21,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:06:21,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:06:21,466 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:06:21,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:06:21,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:06:21,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:06:21,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:06:21,469 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:06:21,469 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:06:21,475 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19;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~mem5, test_fun_#t~mem6, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 9#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 11#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 26#L553true SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L553 23#L554true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 6#L555true assume !(test_fun_#t~mem5 <= 0);havoc test_fun_#t~mem5; 4#L558-11true [2018-11-10 12:06:21,475 INFO L795 eck$LassoCheckResult]: Loop: 4#L558-11true assume true; 17#L558-1true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 20#L558-2true SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 22#L558-3true test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; 24#L558-4true assume !test_fun_#t~short11; 15#L558-9true assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short11;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9; 16#L559true SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3#L559-1true assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12; 29#L562true SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L562 30#L562-1true SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 32#L562-2true SUMMARY for call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L562-2 34#L562-3true havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 4#L558-11true [2018-11-10 12:06:21,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:06:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1802963368, now seen corresponding path program 1 times [2018-11-10 12:06:21,481 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:06:21,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:06:21,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:06:21,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:06:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:06:21,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:06:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash -41976109, now seen corresponding path program 1 times [2018-11-10 12:06:21,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:06:21,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:06:21,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:06:21,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:21,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:06:21,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:06:21,639 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:06:21,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:06:21,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:06:21,651 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-10 12:06:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:06:21,674 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-10 12:06:21,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:06:21,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2018-11-10 12:06:21,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:06:21,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 22 states and 22 transitions. [2018-11-10 12:06:21,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 12:06:21,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 12:06:21,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 22 transitions. [2018-11-10 12:06:21,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:06:21,681 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-10 12:06:21,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 22 transitions. [2018-11-10 12:06:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 12:06:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 12:06:21,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-10 12:06:21,699 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-10 12:06:21,699 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-10 12:06:21,699 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:06:21,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 22 transitions. [2018-11-10 12:06:21,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 12:06:21,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:06:21,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:06:21,701 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:06:21,701 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:06:21,701 INFO L793 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~ret20;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet17, main_#t~nondet18, main_#t~nondet19;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~mem5, test_fun_#t~mem6, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~short11, test_fun_#t~mem16, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 85#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 89#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 86#L553 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L553 82#L554 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 80#L555 assume !(test_fun_#t~mem5 <= 0);havoc test_fun_#t~mem5; 76#L558-11 [2018-11-10 12:06:21,701 INFO L795 eck$LassoCheckResult]: Loop: 76#L558-11 assume true; 77#L558-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 78#L558-2 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-2 79#L558-3 test_fun_#t~short11 := test_fun_#t~mem7 >= test_fun_#t~mem8; 81#L558-4 assume test_fun_#t~short11; 83#L558-5 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-5 87#L558-6 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-6 90#L558-7 test_fun_#t~short11 := test_fun_#t~mem10 <= 2147483647 - test_fun_#t~mem9; 92#L558-9 assume !!test_fun_#t~short11;havoc test_fun_#t~mem8;havoc test_fun_#t~mem10;havoc test_fun_#t~short11;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9; 95#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 74#L559-1 assume !(test_fun_#t~mem12 <= 0);havoc test_fun_#t~mem12; 75#L562 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L562 91#L562-1 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 93#L562-2 SUMMARY for call write~int(test_fun_#t~mem14 + test_fun_#t~mem15, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L562-2 94#L562-3 havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 76#L558-11 [2018-11-10 12:06:21,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:06:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1802963368, now seen corresponding path program 2 times [2018-11-10 12:06:21,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:06:21,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:06:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:06:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:06:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:06:21,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:06:21,732 INFO L82 PathProgramCache]: Analyzing trace with hash 806614918, now seen corresponding path program 1 times [2018-11-10 12:06:21,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:06:21,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:06:21,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:06:21,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:06:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:06:21,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:06:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash -827225345, now seen corresponding path program 1 times [2018-11-10 12:06:21,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:06:21,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:06:21,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:06:21,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:06:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:06:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:06:21,946 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2018-11-10 12:06:22,250 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 109 [2018-11-10 12:06:22,368 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 12:06:22,379 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:06:22,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:06:22,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:06:22,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:06:22,381 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:06:22,381 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:06:22,381 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:06:22,381 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:06:22,381 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.09_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 12:06:22,381 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:06:22,382 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:06:22,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:06:22,768 WARN L179 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 112 [2018-11-10 12:06:22,896 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-11-10 12:06:23,304 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:06:23,307 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:06:23,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,314 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:06:23,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:06:23,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:06:23,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:06:23,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:06:23,342 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:06:23,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:06:23,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:06:23,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:06:23,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:06:23,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:06:23,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:06:23,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:06:23,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:06:23,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:06:23,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:06:23,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:06:23,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:06:23,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:06:23,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:06:23,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:06:23,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:06:23,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:06:23,407 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:06:23,427 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:06:23,427 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 12:06:23,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:06:23,430 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:06:23,430 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:06:23,431 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 4294967293 Supporting invariants [] [2018-11-10 12:06:23,519 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:06:23,524 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:06:23,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:06:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:23,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:06:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:06:23,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:06:23,708 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:06:23,719 INFO L477 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 59 treesize of output 69 [2018-11-10 12:06:23,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2018-11-10 12:06:23,732 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 12:06:23,779 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:06:23,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 12:06:23,790 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 12:06:23,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-11-10 12:06:23,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2018-11-10 12:06:23,930 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:59, output treesize:207 [2018-11-10 12:06:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:23,999 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-11-10 12:06:23,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 22 transitions. cyclomatic complexity: 1 Second operand 12 states. [2018-11-10 12:06:24,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 22 transitions. cyclomatic complexity: 1. Second operand 12 states. Result 38 states and 39 transitions. Complement of second has 20 states. [2018-11-10 12:06:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 12:06:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:06:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-11-10 12:06:24,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 23 transitions. Stem has 7 letters. Loop has 15 letters. [2018-11-10 12:06:24,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:06:24,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 23 transitions. Stem has 22 letters. Loop has 15 letters. [2018-11-10 12:06:24,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:06:24,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 23 transitions. Stem has 7 letters. Loop has 30 letters. [2018-11-10 12:06:24,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:06:24,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 39 transitions. [2018-11-10 12:06:24,154 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:06:24,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2018-11-10 12:06:24,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:06:24,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:06:24,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:06:24,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:06:24,155 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:06:24,155 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:06:24,155 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:06:24,155 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:06:24,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:06:24,155 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:06:24,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:06:24,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:06:24 BoogieIcfgContainer [2018-11-10 12:06:24,160 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:06:24,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:06:24,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:06:24,160 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:06:24,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:06:21" (3/4) ... [2018-11-10 12:06:24,163 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:06:24,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:06:24,163 INFO L168 Benchmark]: Toolchain (without parser) took 3410.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 226.5 MB). Free memory was 957.6 MB in the beginning and 885.7 MB in the end (delta: 71.9 MB). Peak memory consumption was 298.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:24,164 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:06:24,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:24,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.2 MB in the beginning and 1.2 GB in the end (delta: -218.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:24,165 INFO L168 Benchmark]: Boogie Preprocessor took 16.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:06:24,165 INFO L168 Benchmark]: RCFGBuilder took 248.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:24,166 INFO L168 Benchmark]: BuchiAutomizer took 2771.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 237.9 MB). Peak memory consumption was 304.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:24,166 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.3 GB. Free memory was 890.8 MB in the beginning and 885.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:24,169 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.24 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 936.2 MB in the beginning and 1.2 GB in the end (delta: -218.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 248.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2771.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 237.9 MB). Peak memory consumption was 304.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.3 GB. Free memory was 890.8 MB in the beginning and 885.7 MB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 11 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 45 SDtfs, 21 SDslu, 45 SDs, 0 SdLazy, 64 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital308 mio100 ax105 hnf100 lsp91 ukn87 mio100 lsp38 div100 bol100 ite100 ukn100 eq186 hnf88 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...