./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca_true-termination.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_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/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 886a4a8709e4979ee81c36ac10a56c06722d29ce .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:39:55,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:39:55,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:39:55,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:39:55,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:39:55,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:39:55,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:39:55,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:39:55,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:39:55,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:39:55,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:39:55,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:39:55,212 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:39:55,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:39:55,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:39:55,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:39:55,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:39:55,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:39:55,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:39:55,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:39:55,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:39:55,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:39:55,221 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:39:55,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:39:55,222 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:39:55,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:39:55,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:39:55,223 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:39:55,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:39:55,225 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:39:55,225 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:39:55,225 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:39:55,225 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:39:55,226 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:39:55,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:39:55,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:39:55,227 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 01:39:55,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:39:55,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:39:55,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:39:55,239 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:39:55,239 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:39:55,239 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 01:39:55,239 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 01:39:55,239 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 01:39:55,239 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 01:39:55,240 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 01:39:55,240 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 01:39:55,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:39:55,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:39:55,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:39:55,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:39:55,240 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 01:39:55,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 01:39:55,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 01:39:55,241 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:39:55,241 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 01:39:55,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 01:39:55,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:39:55,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:39:55,242 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 01:39:55,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:39:55,242 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:39:55,242 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 01:39:55,243 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 01:39:55,243 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_b65e6f64-2504-477f-b8c9-2b23a13e0f30/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 -> 886a4a8709e4979ee81c36ac10a56c06722d29ce [2018-11-10 01:39:55,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:39:55,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:39:55,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:39:55,280 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:39:55,280 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:39:55,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca_true-termination.c.i [2018-11-10 01:39:55,320 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/data/a3baab4d6/e27ee50f384547afa587e559ae86a29d/FLAGcca259992 [2018-11-10 01:39:55,761 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:39:55,762 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/sv-benchmarks/c/termination-15/cstrchr_diffterm_alloca_true-termination.c.i [2018-11-10 01:39:55,768 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/data/a3baab4d6/e27ee50f384547afa587e559ae86a29d/FLAGcca259992 [2018-11-10 01:39:55,779 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/bin-2019/uautomizer/data/a3baab4d6/e27ee50f384547afa587e559ae86a29d [2018-11-10 01:39:55,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:39:55,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:39:55,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:39:55,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:39:55,787 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:39:55,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:39:55" (1/1) ... [2018-11-10 01:39:55,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a75b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:55, skipping insertion in model container [2018-11-10 01:39:55,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:39:55" (1/1) ... [2018-11-10 01:39:55,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:39:55,822 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:39:56,014 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:39:56,021 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:39:56,048 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:39:56,090 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:39:56,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56 WrapperNode [2018-11-10 01:39:56,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:39:56,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:39:56,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:39:56,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:39:56,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... [2018-11-10 01:39:56,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... [2018-11-10 01:39:56,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:39:56,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:39:56,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:39:56,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:39:56,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... [2018-11-10 01:39:56,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... [2018-11-10 01:39:56,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... [2018-11-10 01:39:56,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... [2018-11-10 01:39:56,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... [2018-11-10 01:39:56,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... [2018-11-10 01:39:56,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... [2018-11-10 01:39:56,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:39:56,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:39:56,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:39:56,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:39:56,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b65e6f64-2504-477f-b8c9-2b23a13e0f30/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 01:39:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 01:39:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 01:39:56,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:39:56,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:39:56,333 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:39:56,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:39:56 BoogieIcfgContainer [2018-11-10 01:39:56,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:39:56,334 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 01:39:56,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 01:39:56,337 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 01:39:56,338 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:39:56,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:39:55" (1/3) ... [2018-11-10 01:39:56,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:39:56, skipping insertion in model container [2018-11-10 01:39:56,339 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:39:56,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:39:56" (2/3) ... [2018-11-10 01:39:56,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:39:56, skipping insertion in model container [2018-11-10 01:39:56,339 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:39:56,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:39:56" (3/3) ... [2018-11-10 01:39:56,341 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrchr_diffterm_alloca_true-termination.c.i [2018-11-10 01:39:56,379 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:39:56,379 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 01:39:56,380 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 01:39:56,380 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 01:39:56,380 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:39:56,380 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:39:56,380 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 01:39:56,380 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:39:56,380 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 01:39:56,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-10 01:39:56,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:39:56,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:39:56,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:39:56,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 01:39:56,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 01:39:56,413 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 01:39:56,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2018-11-10 01:39:56,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:39:56,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:39:56,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:39:56,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 01:39:56,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 01:39:56,423 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~malloc212.base, main_#t~malloc212.offset, main_#t~nondet213, main_#t~ret214.base, main_#t~ret214.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211; 13#L372true assume !(main_~length~0 < 1); 16#L372-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;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];main_#t~malloc212.base, main_#t~malloc212.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc212.base, main_#t~malloc212.offset; 5#L376true SUMMARY for call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L376 8#L376-1true assume { :begin_inline_cstrchr } true;cstrchr_#in~s.base, cstrchr_#in~s.offset, cstrchr_#in~c := main_~nondetString~0.base, main_~nondetString~0.offset, main_#t~nondet213;havoc cstrchr_#res.base, cstrchr_#res.offset;havoc cstrchr_#t~post208.base, cstrchr_#t~post208.offset, cstrchr_#t~mem205, cstrchr_#t~mem206, cstrchr_#t~short207, cstrchr_#t~mem209, cstrchr_#t~ite210.base, cstrchr_#t~ite210.offset, cstrchr_~s.base, cstrchr_~s.offset, cstrchr_~c;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#in~s.base, cstrchr_#in~s.offset;cstrchr_~c := cstrchr_#in~c; 21#L366-9true [2018-11-10 01:39:56,423 INFO L795 eck$LassoCheckResult]: Loop: 21#L366-9true assume true; 6#L366-1true SUMMARY for call cstrchr_#t~mem205 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1); srcloc: L366-1 9#L366-2true cstrchr_#t~short207 := cstrchr_#t~mem205 != 49; 10#L366-3true assume !cstrchr_#t~short207; 17#L366-7true assume !!cstrchr_#t~short207;havoc cstrchr_#t~mem206;havoc cstrchr_#t~short207;havoc cstrchr_#t~mem205;cstrchr_#t~post208.base, cstrchr_#t~post208.offset := cstrchr_~s.base, cstrchr_~s.offset;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#t~post208.base, cstrchr_#t~post208.offset + 1;havoc cstrchr_#t~post208.base, cstrchr_#t~post208.offset; 21#L366-9true [2018-11-10 01:39:56,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:39:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 889568230, now seen corresponding path program 1 times [2018-11-10 01:39:56,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:39:56,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:39:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:39:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:39:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:39:56,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:39:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 43006517, now seen corresponding path program 1 times [2018-11-10 01:39:56,507 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:39:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:39:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:39:56,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:39:56,543 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 01:39:56,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:39:56,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:39:56,547 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 01:39:56,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:39:56,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:39:56,557 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-11-10 01:39:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:39:56,578 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-10 01:39:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:39:56,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-10 01:39:56,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:39:56,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 13 states and 14 transitions. [2018-11-10 01:39:56,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-10 01:39:56,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-10 01:39:56,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-10 01:39:56,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:39:56,585 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 01:39:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-10 01:39:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 01:39:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 01:39:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-10 01:39:56,601 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 01:39:56,602 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-10 01:39:56,602 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 01:39:56,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2018-11-10 01:39:56,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 01:39:56,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:39:56,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:39:56,603 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 01:39:56,603 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:39:56,603 INFO L793 eck$LassoCheckResult]: Stem: 62#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 58#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet211, main_#t~malloc212.base, main_#t~malloc212.offset, main_#t~nondet213, main_#t~ret214.base, main_#t~ret214.offset, main_~length~0, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211; 59#L372 assume !(main_~length~0 < 1); 60#L372-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;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];main_#t~malloc212.base, main_#t~malloc212.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc212.base, main_#t~malloc212.offset; 50#L376 SUMMARY for call write~int(49, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L376 51#L376-1 assume { :begin_inline_cstrchr } true;cstrchr_#in~s.base, cstrchr_#in~s.offset, cstrchr_#in~c := main_~nondetString~0.base, main_~nondetString~0.offset, main_#t~nondet213;havoc cstrchr_#res.base, cstrchr_#res.offset;havoc cstrchr_#t~post208.base, cstrchr_#t~post208.offset, cstrchr_#t~mem205, cstrchr_#t~mem206, cstrchr_#t~short207, cstrchr_#t~mem209, cstrchr_#t~ite210.base, cstrchr_#t~ite210.offset, cstrchr_~s.base, cstrchr_~s.offset, cstrchr_~c;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#in~s.base, cstrchr_#in~s.offset;cstrchr_~c := cstrchr_#in~c; 54#L366-9 [2018-11-10 01:39:56,603 INFO L795 eck$LassoCheckResult]: Loop: 54#L366-9 assume true; 52#L366-1 SUMMARY for call cstrchr_#t~mem205 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1); srcloc: L366-1 53#L366-2 cstrchr_#t~short207 := cstrchr_#t~mem205 != 49; 55#L366-3 assume cstrchr_#t~short207; 56#L366-4 SUMMARY for call cstrchr_#t~mem206 := read~int(cstrchr_~s.base, cstrchr_~s.offset, 1); srcloc: L366-4 57#L366-5 cstrchr_#t~short207 := cstrchr_#t~mem206 != (if cstrchr_~c % 256 <= 127 then cstrchr_~c % 256 else cstrchr_~c % 256 - 256); 61#L366-7 assume !!cstrchr_#t~short207;havoc cstrchr_#t~mem206;havoc cstrchr_#t~short207;havoc cstrchr_#t~mem205;cstrchr_#t~post208.base, cstrchr_#t~post208.offset := cstrchr_~s.base, cstrchr_~s.offset;cstrchr_~s.base, cstrchr_~s.offset := cstrchr_#t~post208.base, cstrchr_#t~post208.offset + 1;havoc cstrchr_#t~post208.base, cstrchr_#t~post208.offset; 54#L366-9 [2018-11-10 01:39:56,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:39:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash 889568230, now seen corresponding path program 2 times [2018-11-10 01:39:56,604 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:39:56,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:39:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:39:56,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:39:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:39:56,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:39:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1620537192, now seen corresponding path program 1 times [2018-11-10 01:39:56,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:39:56,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:39:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:39:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:39:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:39:56,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:39:56,638 INFO L82 PathProgramCache]: Analyzing trace with hash 318216467, now seen corresponding path program 1 times [2018-11-10 01:39:56,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:39:56,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:39:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:39:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:39:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:39:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:39:56,782 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-11-10 01:39:57,019 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-10 01:39:57,069 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:39:57,070 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:39:57,070 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:39:57,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:39:57,071 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:39:57,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:39:57,071 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:39:57,071 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:39:57,071 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrchr_diffterm_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 01:39:57,071 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:39:57,071 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:39:57,088 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 01:39:57,092 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 01:39:57,093 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 01:39:57,096 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 01:39:57,097 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 01:39:57,099 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 01:39:57,100 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 01:39:57,102 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 01:39:57,103 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 01:39:57,105 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 01:39:57,114 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 01:39:57,115 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 01:39:57,117 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 01:39:57,311 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 01:39:57,312 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 01:39:57,314 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 01:39:57,315 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 01:39:57,649 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2018-11-10 01:39:57,662 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:39:57,667 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:39:57,668 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 01:39:57,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,674 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 01:39:57,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,676 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 01:39:57,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:39:57,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:39:57,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,680 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 01:39:57,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,682 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 01:39:57,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,683 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,684 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 01:39:57,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,686 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 01:39:57,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,688 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 01:39:57,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,691 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 01:39:57,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,694 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 01:39:57,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:39:57,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:39:57,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,700 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 01:39:57,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,704 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 01:39:57,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:39:57,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:39:57,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:39:57,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,708 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 01:39:57,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:39:57,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:39:57,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:39:57,717 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 01:39:57,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:39:57,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:39:57,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:39:57,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:39:57,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:39:57,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:39:57,765 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:39:57,790 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 01:39:57,790 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 01:39:57,792 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:39:57,794 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:39:57,794 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:39:57,795 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrchr_~s.offset, v_rep(select #length ULTIMATE.start_cstrchr_~s.base)_1) = -1*ULTIMATE.start_cstrchr_~s.offset + 1*v_rep(select #length ULTIMATE.start_cstrchr_~s.base)_1 Supporting invariants [] [2018-11-10 01:39:57,806 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 01:39:57,812 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 01:39:57,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:39:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:39:57,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:39:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:39:57,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:39:57,876 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 01:39:57,878 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 01:39:57,878 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-10 01:39:57,913 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 20 states and 22 transitions. Complement of second has 6 states. [2018-11-10 01:39:57,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 01:39:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:39:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-10 01:39:57,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 6 letters. Loop has 7 letters. [2018-11-10 01:39:57,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:39:57,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 01:39:57,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:39:57,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 6 letters. Loop has 14 letters. [2018-11-10 01:39:57,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:39:57,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-11-10 01:39:57,917 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 01:39:57,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2018-11-10 01:39:57,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 01:39:57,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 01:39:57,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 01:39:57,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 01:39:57,918 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:39:57,918 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:39:57,918 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:39:57,918 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 01:39:57,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 01:39:57,918 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 01:39:57,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 01:39:57,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:39:57 BoogieIcfgContainer [2018-11-10 01:39:57,922 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 01:39:57,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:39:57,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:39:57,922 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:39:57,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:39:56" (3/4) ... [2018-11-10 01:39:57,925 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 01:39:57,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:39:57,925 INFO L168 Benchmark]: Toolchain (without parser) took 2143.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -256.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:39:57,926 INFO L168 Benchmark]: CDTParser took 0.14 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 01:39:57,926 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.21 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.7 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:39:57,927 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 930.7 MB in the beginning and 1.1 GB in the end (delta: -213.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 01:39:57,927 INFO L168 Benchmark]: Boogie Preprocessor took 13.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:39:57,927 INFO L168 Benchmark]: RCFGBuilder took 162.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-10 01:39:57,928 INFO L168 Benchmark]: BuchiAutomizer took 1588.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:39:57,928 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:39:57,930 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.14 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 307.21 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.7 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 930.7 MB in the beginning and 1.1 GB in the end (delta: -213.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 162.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1588.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.67 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -1 * s + unknown-#length-unknown[s] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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 13 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 11 SDslu, 21 SDs, 0 SdLazy, 12 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital190 mio100 ax100 hnf99 lsp98 ukn83 mio100 lsp32 div141 bol100 ite100 ukn100 eq153 hnf77 smp100 dnf729 smp33 tf100 neg94 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms 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...