./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_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_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/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 c9cfd4c0ab406cfeab77b774b2e25db3fba848a9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:12:25,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:12:25,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:12:25,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:12:25,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:12:25,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:12:25,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:12:25,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:12:25,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:12:25,155 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:12:25,156 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:12:25,156 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:12:25,157 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:12:25,158 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:12:25,158 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:12:25,159 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:12:25,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:12:25,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:12:25,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:12:25,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:12:25,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:12:25,164 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:12:25,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:12:25,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:12:25,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:12:25,167 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:12:25,167 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:12:25,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:12:25,168 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:12:25,169 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:12:25,169 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:12:25,170 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:12:25,170 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:12:25,170 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:12:25,171 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:12:25,171 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:12:25,172 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 04:12:25,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:12:25,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:12:25,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:12:25,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:12:25,184 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 04:12:25,184 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 04:12:25,185 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 04:12:25,185 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 04:12:25,185 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 04:12:25,185 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 04:12:25,185 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 04:12:25,185 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:12:25,185 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 04:12:25,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:12:25,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:12:25,186 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 04:12:25,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 04:12:25,186 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 04:12:25,186 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:12:25,186 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 04:12:25,186 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 04:12:25,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:12:25,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:12:25,187 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 04:12:25,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:12:25,187 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 04:12:25,187 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 04:12:25,188 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 04:12:25,188 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_99bc1558-4e68-43e6-9acd-05912a6c7b9a/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 -> c9cfd4c0ab406cfeab77b774b2e25db3fba848a9 [2018-11-10 04:12:25,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:12:25,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:12:25,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:12:25,224 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:12:25,225 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:12:25,225 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-10 04:12:25,271 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/data/3ee57b8ad/52a14f72abcc487fbd59b74291ff1bce/FLAG12ab1011e [2018-11-10 04:12:25,646 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:12:25,647 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-10 04:12:25,654 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/data/3ee57b8ad/52a14f72abcc487fbd59b74291ff1bce/FLAG12ab1011e [2018-11-10 04:12:25,664 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/bin-2019/uautomizer/data/3ee57b8ad/52a14f72abcc487fbd59b74291ff1bce [2018-11-10 04:12:25,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:12:25,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:12:25,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:12:25,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:12:25,670 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:12:25,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:25,672 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 04:12:25, skipping insertion in model container [2018-11-10 04:12:25,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:25,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:12:25,703 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:12:25,892 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:12:25,899 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:12:25,926 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:12:25,968 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:12:25,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25 WrapperNode [2018-11-10 04:12:25,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:12:25,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:12:25,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:12:25,970 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:12:25,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:26,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:26,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:12:26,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:12:26,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:12:26,042 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:12:26,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:26,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:26,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:26,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:26,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:26,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:26,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... [2018-11-10 04:12:26,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:12:26,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:12:26,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:12:26,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:12:26,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_99bc1558-4e68-43e6-9acd-05912a6c7b9a/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 04:12:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 04:12:26,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 04:12:26,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:12:26,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:12:26,265 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:12:26,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:12:26 BoogieIcfgContainer [2018-11-10 04:12:26,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:12:26,266 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 04:12:26,266 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 04:12:26,269 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 04:12:26,269 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:12:26,269 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 04:12:25" (1/3) ... [2018-11-10 04:12:26,270 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18be946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:12:26, skipping insertion in model container [2018-11-10 04:12:26,270 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:12:26,270 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:12:25" (2/3) ... [2018-11-10 04:12:26,271 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18be946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 04:12:26, skipping insertion in model container [2018-11-10 04:12:26,271 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 04:12:26,271 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:12:26" (3/3) ... [2018-11-10 04:12:26,272 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_mixed_alloca_true-termination.c.i [2018-11-10 04:12:26,307 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:12:26,307 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 04:12:26,307 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 04:12:26,307 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 04:12:26,307 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:12:26,307 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:12:26,308 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 04:12:26,308 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:12:26,308 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 04:12:26,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 04:12:26,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:12:26,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:12:26,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:12:26,343 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:26,344 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:26,344 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 04:12:26,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 04:12:26,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:12:26,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:12:26,346 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:12:26,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:26,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:26,352 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 10#L382true assume !(main_~length1~0 < 1); 14#L382-2true assume !(main_~length2~0 < 1); 7#L385-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~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~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~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~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 27#L390true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 29#L390-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 13#L391true main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 4#L369-5true [2018-11-10 04:12:26,354 INFO L795 eck$LassoCheckResult]: Loop: 4#L369-5true assume true; 16#L369-1true SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 18#L369-2true assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 11#L371true SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 12#L371-1true cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 21#L372-9true assume !true; 22#L372-10true SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 5#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 3#L369-4true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 4#L369-5true [2018-11-10 04:12:26,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 04:12:26,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:26,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:26,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:26,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-11-10 04:12:26,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:26,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:26,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:26,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:26,490 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 04:12:26,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:12:26,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:12:26,495 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:12:26,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 04:12:26,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 04:12:26,508 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 04:12:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:12:26,514 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 04:12:26,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 04:12:26,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 04:12:26,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:12:26,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-11-10 04:12:26,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 04:12:26,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 04:12:26,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 04:12:26,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:12:26,521 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 04:12:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 04:12:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 04:12:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 04:12:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 04:12:26,542 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 04:12:26,542 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 04:12:26,543 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 04:12:26,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 04:12:26,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 04:12:26,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:12:26,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:12:26,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:26,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:26,544 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 75#L382 assume !(main_~length1~0 < 1); 76#L382-2 assume !(main_~length2~0 < 1); 72#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~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~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~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~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 73#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 84#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 82#L391 main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 68#L369-5 [2018-11-10 04:12:26,545 INFO L795 eck$LassoCheckResult]: Loop: 68#L369-5 assume true; 69#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 85#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 78#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 79#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 66#L372-9 assume true; 71#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 80#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 81#L372-3 assume !cstrpbrk_#t~short210; 64#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 65#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 70#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 67#L369-4 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 68#L369-5 [2018-11-10 04:12:26,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 04:12:26,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:26,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:26,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:26,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:26,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-11-10 04:12:26,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:26,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:26,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:12:26,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:26,695 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 04:12:26,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:12:26,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 04:12:26,695 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:12:26,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 04:12:26,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:12:26,696 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 04:12:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:12:26,895 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-10 04:12:26,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 04:12:26,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-10 04:12:26,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 04:12:26,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-11-10 04:12:26,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 04:12:26,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 04:12:26,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-10 04:12:26,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:12:26,899 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-10 04:12:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-10 04:12:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-10 04:12:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 04:12:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-10 04:12:26,902 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 04:12:26,902 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 04:12:26,902 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 04:12:26,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-11-10 04:12:26,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 04:12:26,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:12:26,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:12:26,904 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:26,904 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:26,904 INFO L793 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 160#L382 assume !(main_~length1~0 < 1); 161#L382-2 assume !(main_~length2~0 < 1); 156#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~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~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~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~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 157#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 169#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 167#L391 main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 152#L369-5 [2018-11-10 04:12:26,904 INFO L795 eck$LassoCheckResult]: Loop: 152#L369-5 assume true; 153#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 170#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 162#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 163#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 150#L372-9 assume true; 155#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 165#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 166#L372-3 assume cstrpbrk_#t~short210; 168#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 171#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 172#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 158#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 154#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 151#L369-4 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 152#L369-5 [2018-11-10 04:12:26,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-11-10 04:12:26,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:26,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:26,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:26,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:26,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:26,929 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-11-10 04:12:26,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:26,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:26,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:12:26,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:26,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-11-10 04:12:26,949 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:26,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:26,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:26,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:27,106 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-10 04:12:27,274 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-10 04:12:27,441 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2018-11-10 04:12:27,516 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:12:27,517 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:12:27,517 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:12:27,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:12:27,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:12:27,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:12:27,518 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:12:27,518 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:12:27,518 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 04:12:27,518 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:12:27,518 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:12:27,535 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 04:12:27,538 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 04:12:27,539 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 04:12:27,770 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-11-10 04:12:27,894 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-11-10 04:12:27,894 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 04:12:27,896 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 04:12:27,897 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 04:12:27,898 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 04:12:27,899 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 04:12:27,900 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 04:12:27,901 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 04:12:27,902 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 04:12:27,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:12:27,904 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 04:12:27,905 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 04:12:27,907 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 04:12:27,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:12:27,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:12:27,911 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 04:12:27,912 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 04:12:27,913 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 04:12:28,300 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:12:28,303 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:12:28,304 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 04:12:28,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:28,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:28,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:28,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:28,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:28,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:28,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:28,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:28,308 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 04:12:28,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:28,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:28,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:28,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:28,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:28,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:28,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:28,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:28,310 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 04:12:28,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:28,310 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:12:28,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:28,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:28,314 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:12:28,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:28,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:28,328 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 04:12:28,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:28,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:28,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:28,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:28,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:28,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:28,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:28,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 04:12:28,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:28,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:28,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:28,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:28,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:28,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:28,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:28,339 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 04:12:28,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:28,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:28,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:28,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:28,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:28,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:28,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:12:28,408 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 04:12:28,408 INFO L444 ModelExtractionUtils]: 44 out of 52 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 04:12:28,410 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:12:28,412 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:12:28,412 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:12:28,412 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2018-11-10 04:12:28,450 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 04:12:28,456 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:12:28,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:28,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:28,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:28,539 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 04:12:28,541 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 04:12:28,542 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 04:12:28,581 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 40 states and 47 transitions. Complement of second has 7 states. [2018-11-10 04:12:28,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 04:12:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 04:12:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-10 04:12:28,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-11-10 04:12:28,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:28,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-11-10 04:12:28,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:28,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-11-10 04:12:28,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:28,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-11-10 04:12:28,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 04:12:28,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-11-10 04:12:28,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 04:12:28,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 04:12:28,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-11-10 04:12:28,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:12:28,587 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-10 04:12:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-11-10 04:12:28,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 04:12:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 04:12:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-10 04:12:28,589 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 04:12:28,589 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 04:12:28,589 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 04:12:28,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-11-10 04:12:28,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 04:12:28,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:12:28,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:12:28,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:28,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 04:12:28,590 INFO L793 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 365#L382 assume !(main_~length1~0 < 1); 366#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~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~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~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~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 362#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 379#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 376#L391 main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 355#L369-5 assume true; 357#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 382#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 367#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 368#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 350#L372-9 [2018-11-10 04:12:28,591 INFO L795 eck$LassoCheckResult]: Loop: 350#L372-9 assume true; 359#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 371#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 374#L372-3 assume !cstrpbrk_#t~short210; 349#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 350#L372-9 [2018-11-10 04:12:28,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-11-10 04:12:28,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:28,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-11-10 04:12:28,610 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:28,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:28,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:28,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:28,618 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 04:12:28,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:12:28,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 04:12:28,619 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 04:12:28,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:12:28,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:12:28,619 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 04:12:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:12:28,627 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-10 04:12:28,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:12:28,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-10 04:12:28,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 04:12:28,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-11-10 04:12:28,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 04:12:28,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 04:12:28,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-11-10 04:12:28,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:12:28,629 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 04:12:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-11-10 04:12:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 04:12:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 04:12:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 04:12:28,631 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 04:12:28,631 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 04:12:28,631 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 04:12:28,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 04:12:28,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 04:12:28,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:12:28,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:12:28,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:28,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:28,633 INFO L793 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 443#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 444#L382 assume !(main_~length1~0 < 1); 445#L382-2 assume !(main_~length2~0 < 1); 441#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~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~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~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~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 442#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 458#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 455#L391 main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 435#L369-5 assume true; 437#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 459#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 447#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 448#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 429#L372-9 [2018-11-10 04:12:28,633 INFO L795 eck$LassoCheckResult]: Loop: 429#L372-9 assume true; 439#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 451#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 453#L372-3 assume cstrpbrk_#t~short210; 456#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 461#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 428#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 429#L372-9 [2018-11-10 04:12:28,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-11-10 04:12:28,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:28,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:28,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-11-10 04:12:28,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:28,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:12:28,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:28,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-11-10 04:12:28,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:28,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:28,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:28,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:28,980 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2018-11-10 04:12:29,079 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:12:29,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:12:29,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:12:29,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:12:29,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:12:29,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:12:29,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:12:29,080 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:12:29,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 04:12:29,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:12:29,080 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:12:29,083 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 04:12:29,084 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 04:12:29,085 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 04:12:29,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 04:12:29,089 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 04:12:29,090 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 04:12:29,091 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 04:12:29,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 04:12:29,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 04:12:29,094 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 04:12:29,095 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 04:12:29,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 04:12:29,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 04:12:29,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 04:12:29,098 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 04:12:29,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 04:12:29,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 04:12:29,101 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 04:12:29,353 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2018-11-10 04:12:29,454 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 04:12:29,455 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 04:12:29,457 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 04:12:29,932 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:12:29,933 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:12:29,933 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 04:12:29,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,935 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 04:12:29,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,940 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 04:12:29,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,941 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:29,941 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:29,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,943 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 04:12:29,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,945 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 04:12:29,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,946 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,946 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 04:12:29,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,948 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,948 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 04:12:29,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,951 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,952 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 04:12:29,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:29,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:29,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,953 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 04:12:29,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:29,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:29,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,956 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 04:12:29,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,957 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 04:12:29,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,958 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 04:12:29,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,959 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 04:12:29,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,960 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 04:12:29,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,961 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,962 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 04:12:29,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,963 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 04:12:29,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,965 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 04:12:29,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 04:12:29,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 04:12:29,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 04:12:29,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,966 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 04:12:29,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:29,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:29,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,969 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 04:12:29,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,970 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:12:29,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,971 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:12:29,971 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:29,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:12:29,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:29,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:29,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 04:12:29,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,981 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:12:29,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,983 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:12:29,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:29,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,990 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 04:12:29,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:29,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:29,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,993 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 04:12:29,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:29,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:29,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:29,997 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 04:12:29,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:29,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:29,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:29,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:29,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:29,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:30,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:30,002 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 04:12:30,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:30,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:30,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:30,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:30,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:30,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:30,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:30,006 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 04:12:30,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:30,006 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:12:30,006 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 04:12:30,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:30,021 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-10 04:12:30,022 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-10 04:12:30,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:30,076 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 04:12:30,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:30,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:30,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:30,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:30,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:30,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:30,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:30,079 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 04:12:30,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:30,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:30,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:30,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:30,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:30,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:30,097 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:12:30,109 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 04:12:30,109 INFO L444 ModelExtractionUtils]: 61 out of 64 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 04:12:30,109 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:12:30,110 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:12:30,110 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:12:30,110 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1 Supporting invariants [] [2018-11-10 04:12:30,168 INFO L297 tatePredicateManager]: 19 out of 19 supporting invariants were superfluous and have been removed [2018-11-10 04:12:30,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:30,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:30,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:30,201 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 04:12:30,202 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 04:12:30,202 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-11-10 04:12:30,217 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 86 states and 94 transitions. Complement of second has 7 states. [2018-11-10 04:12:30,218 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 04:12:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:12:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 04:12:30,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 04:12:30,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:30,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 04:12:30,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:30,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 04:12:30,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:30,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-11-10 04:12:30,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 04:12:30,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-11-10 04:12:30,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 04:12:30,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 04:12:30,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-11-10 04:12:30,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 04:12:30,222 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-10 04:12:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-11-10 04:12:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-10 04:12:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 04:12:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-10 04:12:30,226 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 04:12:30,226 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 04:12:30,226 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 04:12:30,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-11-10 04:12:30,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 04:12:30,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 04:12:30,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 04:12:30,227 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:30,227 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:12:30,227 INFO L793 eck$LassoCheckResult]: Stem: 735#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 727#L382 assume !(main_~length1~0 < 1); 728#L382-2 assume !(main_~length2~0 < 1); 724#L385-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~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~malloc215.base, main_#t~malloc215.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~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~malloc216.base, main_#t~malloc216.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset; 725#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L390 741#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 738#L391 main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 715#L369-5 assume true; 716#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 746#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 731#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 732#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 721#L372-9 assume true; 723#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 734#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 737#L372-3 assume cstrpbrk_#t~short210; 740#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 743#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 711#L372-7 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210; 712#L372-10 SUMMARY for call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-10 719#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 713#L369-4 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset + 1;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 714#L369-5 assume true; 718#L369-1 SUMMARY for call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L369-1 744#L369-2 assume !!(cstrpbrk_#t~mem206 != 0);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 729#L371 SUMMARY for call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); srcloc: L371 730#L371-1 cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 710#L372-9 [2018-11-10 04:12:30,227 INFO L795 eck$LassoCheckResult]: Loop: 710#L372-9 assume true; 720#L372-1 SUMMARY for call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-1 733#L372-2 cstrpbrk_#t~short210 := cstrpbrk_#t~mem208 != 0; 736#L372-3 assume cstrpbrk_#t~short210; 739#L372-4 SUMMARY for call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); srcloc: L372-4 742#L372-5 cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 709#L372-7 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset - 1;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 710#L372-9 [2018-11-10 04:12:30,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:30,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-11-10 04:12:30,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:30,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:30,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:30,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:12:30,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:30,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-11-10 04:12:30,248 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:30,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:30,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:12:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:30,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:30,253 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-11-10 04:12:30,253 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 04:12:30,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 04:12:30,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:30,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 04:12:30,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:12:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:12:30,810 WARN L179 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 152 [2018-11-10 04:12:31,462 WARN L179 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 121 [2018-11-10 04:12:31,464 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 04:12:31,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 04:12:31,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 04:12:31,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 04:12:31,464 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 04:12:31,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 04:12:31,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 04:12:31,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 04:12:31,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_mixed_alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 04:12:31,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 04:12:31,465 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 04:12:31,468 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 04:12:31,638 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 04:12:32,230 WARN L179 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 119 [2018-11-10 04:12:32,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:12:32,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:12:32,342 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 04:12:32,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 04:12:32,345 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 04:12:32,346 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 04:12:32,347 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 04:12:32,350 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 04:12:32,351 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 04:12:32,352 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 04:12:32,352 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 04:12:32,354 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 04:12:32,355 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 04:12:32,356 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 04:12:32,356 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 04:12:32,357 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 04:12:32,358 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 04:12:32,359 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 04:12:32,360 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 04:12:32,361 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 04:12:32,812 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-11-10 04:12:33,047 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 04:12:33,048 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 04:12:33,048 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 04:12:33,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:33,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:33,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:33,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:33,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:33,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:33,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:33,052 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 04:12:33,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:33,056 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-10 04:12:33,056 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 04:12:33,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:33,076 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-10 04:12:33,076 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-10 04:12:33,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:33,183 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 04:12:33,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:33,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:33,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:33,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:33,185 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:33,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:33,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:33,188 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 04:12:33,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:33,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 04:12:33,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:33,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:33,190 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 04:12:33,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:33,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:33,194 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 04:12:33,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:33,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:33,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:33,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:33,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:33,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:33,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:33,197 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 04:12:33,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:33,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:33,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:33,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:33,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:33,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:33,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 04:12:33,199 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 04:12:33,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 04:12:33,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 04:12:33,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 04:12:33,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 04:12:33,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 04:12:33,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 04:12:33,217 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 04:12:33,229 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 04:12:33,229 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 04:12:33,229 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 04:12:33,230 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 04:12:33,230 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 04:12:33,230 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3) = 2*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3 Supporting invariants [] [2018-11-10 04:12:33,366 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2018-11-10 04:12:33,368 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 04:12:33,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:33,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:33,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:33,424 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 04:12:33,424 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 04:12:33,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 04:12:33,445 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 80 states and 86 transitions. Complement of second has 7 states. [2018-11-10 04:12:33,445 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 04:12:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:12:33,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 04:12:33,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 04:12:33,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:33,445 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:12:33,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:33,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:33,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:33,482 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 04:12:33,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:12:33,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 04:12:33,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 80 states and 86 transitions. Complement of second has 7 states. [2018-11-10 04:12:33,497 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 04:12:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:12:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 04:12:33,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 04:12:33,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:33,498 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 04:12:33,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:12:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:33,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:12:33,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:12:33,539 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 04:12:33,539 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 04:12:33,539 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 04:12:33,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 85 states and 92 transitions. Complement of second has 6 states. [2018-11-10 04:12:33,556 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 04:12:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 04:12:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-11-10 04:12:33,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 04:12:33,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:33,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 04:12:33,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:33,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 28 letters. Loop has 14 letters. [2018-11-10 04:12:33,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 04:12:33,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-11-10 04:12:33,559 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:12:33,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-11-10 04:12:33,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 04:12:33,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 04:12:33,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 04:12:33,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 04:12:33,560 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:12:33,560 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:12:33,560 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 04:12:33,560 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 04:12:33,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 04:12:33,560 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 04:12:33,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 04:12:33,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 04:12:33 BoogieIcfgContainer [2018-11-10 04:12:33,567 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 04:12:33,568 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:12:33,568 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:12:33,568 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:12:33,568 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:12:26" (3/4) ... [2018-11-10 04:12:33,571 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:12:33,571 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:12:33,572 INFO L168 Benchmark]: Toolchain (without parser) took 7904.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 956.6 MB in the beginning and 983.7 MB in the end (delta: -27.2 MB). Peak memory consumption was 345.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:12:33,573 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 04:12:33,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.23 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:12:33,573 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:12:33,574 INFO L168 Benchmark]: Boogie Preprocessor took 14.67 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 04:12:33,574 INFO L168 Benchmark]: RCFGBuilder took 209.42 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: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2018-11-10 04:12:33,574 INFO L168 Benchmark]: BuchiAutomizer took 7301.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.1 GB in the beginning and 983.7 MB in the end (delta: 111.9 MB). Peak memory consumption was 358.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:12:33,574 INFO L168 Benchmark]: Witness Printer took 3.61 ms. Allocated memory is still 1.4 GB. Free memory is still 983.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:12:33,577 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 301.23 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 929.6 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 71.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -189.4 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.67 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 209.42 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: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7301.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.9 MB). Free memory was 1.1 GB in the beginning and 983.7 MB in the end (delta: 111.9 MB). Peak memory consumption was 358.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 ms. Allocated memory is still 1.4 GB. Free memory is still 983.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + -1 * sc1 and consists of 5 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 4 locations. One nondeterministic module has affine ranking function 2 * s + unknown-#length-unknown[s] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 203 SDtfs, 216 SDslu, 147 SDs, 0 SdLazy, 171 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital387 mio100 ax100 hnf99 lsp90 ukn89 mio100 lsp35 div115 bol100 ite100 ukn100 eq181 hnf82 smp92 dnf524 smp29 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 130ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...