./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-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_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/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 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:28,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:28,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:28,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:28,153 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:28,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:28,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:28,156 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:28,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:28,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:28,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:28,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:28,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:28,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:28,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:28,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:28,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:28,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:28,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:28,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:28,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:28,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:28,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:28,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:28,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:28,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:28,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:28,174 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:28,175 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:28,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:28,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:28,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:28,178 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:28,178 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:28,179 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:28,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:28,180 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:08:28,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:28,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:28,193 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:08:28,193 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:08:28,193 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:08:28,194 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:08:28,194 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:08:28,194 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:08:28,194 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:08:28,194 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:08:28,194 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:08:28,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:28,195 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:08:28,195 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:28,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:28,195 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:08:28,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:08:28,197 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:08:28,197 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:28,197 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:08:28,197 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:08:28,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:28,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:28,198 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:08:28,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:28,198 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:08:28,198 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:08:28,199 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:08:28,199 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_567da619-32fd-486a-bbc6-4f4f8e0d75e9/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 -> 54ff0e2671f1fbdd267f9aba90cfe8fb60d3ccde [2018-10-27 06:08:28,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:28,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:28,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:28,238 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:28,238 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:28,239 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2018-10-27 06:08:28,282 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/data/6ce2e84ab/d6f07f2081e240738ce13c75744119fc/FLAGd152a099c [2018-10-27 06:08:28,684 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:28,684 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/sv-benchmarks/c/termination-memory-alloca/cstrcspn-alloca_true-termination.c.i [2018-10-27 06:08:28,699 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/data/6ce2e84ab/d6f07f2081e240738ce13c75744119fc/FLAGd152a099c [2018-10-27 06:08:28,712 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/data/6ce2e84ab/d6f07f2081e240738ce13c75744119fc [2018-10-27 06:08:28,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:28,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:08:28,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:28,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:28,719 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:28,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:28" (1/1) ... [2018-10-27 06:08:28,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ef67c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:28, skipping insertion in model container [2018-10-27 06:08:28,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:28" (1/1) ... [2018-10-27 06:08:28,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:28,761 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:28,982 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:28,990 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:29,026 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:29,062 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:29,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29 WrapperNode [2018-10-27 06:08:29,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:29,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:29,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:29,063 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:29,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... [2018-10-27 06:08:29,083 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... [2018-10-27 06:08:29,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:29,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:29,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:29,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:29,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... [2018-10-27 06:08:29,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... [2018-10-27 06:08:29,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... [2018-10-27 06:08:29,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... [2018-10-27 06:08:29,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... [2018-10-27 06:08:29,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... [2018-10-27 06:08:29,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... [2018-10-27 06:08:29,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:29,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:29,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:29,190 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:29,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/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-10-27 06:08:29,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:08:29,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:08:29,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:29,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:29,687 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:29,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:29 BoogieIcfgContainer [2018-10-27 06:08:29,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:29,689 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:08:29,689 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:08:29,692 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:08:29,693 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:29,693 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:08:28" (1/3) ... [2018-10-27 06:08:29,694 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b02f391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:29, skipping insertion in model container [2018-10-27 06:08:29,694 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:29,694 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:29" (2/3) ... [2018-10-27 06:08:29,695 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b02f391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:08:29, skipping insertion in model container [2018-10-27 06:08:29,695 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:08:29,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:29" (3/3) ... [2018-10-27 06:08:29,696 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn-alloca_true-termination.c.i [2018-10-27 06:08:29,742 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:08:29,743 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:08:29,743 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:08:29,743 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:08:29,743 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:29,743 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:29,743 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:08:29,743 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:29,743 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:08:29,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:08:29,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:08:29,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:29,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:29,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:29,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:29,785 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:08:29,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-10-27 06:08:29,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:08:29,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:29,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:29,787 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:29,787 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:29,794 INFO L793 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 21#L565true assume !(main_~length1~0 < 1); 13#L565-2true assume !(main_~length2~0 < 1); 7#L568-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 26#L573true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 28#L573-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 12#L574true assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 4#L552-5true [2018-10-27 06:08:29,795 INFO L795 eck$LassoCheckResult]: Loop: 4#L552-5true assume true; 14#L552-1true SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L552-1 16#L552-2true assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 22#L554true SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L554 11#L554-1true cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 19#L555-9true assume !true; 20#L555-10true SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-10 5#L557true assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 3#L552-4true cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 4#L552-5true [2018-10-27 06:08:29,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:08:29,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:29,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:29,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-10-27 06:08:29,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:29,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:29,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:29,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:29,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:29,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:29,979 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:29,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:08:29,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:08:29,996 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-27 06:08:30,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:30,003 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-10-27 06:08:30,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:08:30,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-10-27 06:08:30,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:08:30,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-10-27 06:08:30,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-10-27 06:08:30,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-10-27 06:08:30,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-10-27 06:08:30,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:08:30,013 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:08:30,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-10-27 06:08:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 06:08:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 06:08:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-10-27 06:08:30,039 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:08:30,039 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-10-27 06:08:30,040 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:08:30,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-10-27 06:08:30,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:08:30,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:30,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:30,042 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:30,042 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:30,042 INFO L793 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 74#L565 assume !(main_~length1~0 < 1); 75#L565-2 assume !(main_~length2~0 < 1); 72#L568-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 73#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 84#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 81#L574 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 68#L552-5 [2018-10-27 06:08:30,042 INFO L795 eck$LassoCheckResult]: Loop: 68#L552-5 assume true; 69#L552-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L552-1 85#L552-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 76#L554 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L554 77#L554-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 66#L555-9 assume true; 71#L555-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-1 78#L555-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 80#L555-3 assume !cstrcspn_#t~short7; 64#L555-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 65#L555-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-10 70#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 67#L552-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 68#L552-5 [2018-10-27 06:08:30,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,043 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-10-27 06:08:30,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:30,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:30,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:30,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-10-27 06:08:30,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:30,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:30,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:30,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1600668446, now seen corresponding path program 1 times [2018-10-27 06:08:30,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:30,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:30,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:30,584 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-10-27 06:08:31,402 WARN L179 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-10-27 06:08:31,531 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-10-27 06:08:31,541 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:31,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:31,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:31,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:31,543 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:31,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:31,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:31,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:31,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration2_Lasso [2018-10-27 06:08:31,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:31,543 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:31,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:31,967 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-10-27 06:08:32,171 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-10-27 06:08:32,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:32,676 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:32,680 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:32,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:32,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,693 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-10-27 06:08:32,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,699 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-10-27 06:08:32,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,702 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-10-27 06:08:32,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,705 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-10-27 06:08:32,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,707 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,710 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-10-27 06:08:32,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,740 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-10-27 06:08:32,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:32,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:32,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:32,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,743 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-10-27 06:08:32,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,749 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-10-27 06:08:32,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:32,770 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-10-27 06:08:32,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:32,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:32,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:32,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:32,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:32,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:32,815 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:32,839 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:08:32,839 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:08:32,841 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:32,844 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:32,844 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:32,845 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-10-27 06:08:32,927 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:08:32,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:32,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:33,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:33,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:33,073 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-10-27 06:08:33,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-10-27 06:08:33,165 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 38 states and 45 transitions. Complement of second has 7 states. [2018-10-27 06:08:33,165 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-10-27 06:08:33,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:08:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-10-27 06:08:33,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 13 letters. [2018-10-27 06:08:33,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:33,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 13 letters. [2018-10-27 06:08:33,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:33,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 26 letters. [2018-10-27 06:08:33,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:33,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2018-10-27 06:08:33,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:33,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 35 states and 42 transitions. [2018-10-27 06:08:33,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-10-27 06:08:33,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:08:33,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-10-27 06:08:33,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:33,172 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-10-27 06:08:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-10-27 06:08:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-27 06:08:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 06:08:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-10-27 06:08:33,174 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-10-27 06:08:33,175 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-10-27 06:08:33,175 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:08:33,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-10-27 06:08:33,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:33,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:33,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:33,176 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:33,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:08:33,176 INFO L793 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 270#L565 assume !(main_~length1~0 < 1); 271#L565-2 assume !(main_~length2~0 < 1); 268#L568-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 269#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 285#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 281#L574 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 262#L552-5 assume true; 264#L552-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L552-1 286#L552-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 272#L554 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L554 273#L554-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 256#L555-9 [2018-10-27 06:08:33,177 INFO L795 eck$LassoCheckResult]: Loop: 256#L555-9 assume true; 266#L555-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-1 276#L555-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 279#L555-3 assume !cstrcspn_#t~short7; 255#L555-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 256#L555-9 [2018-10-27 06:08:33,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-10-27 06:08:33,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,200 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-10-27 06:08:33,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:33,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:33,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:08:33,244 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:08:33,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:33,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:33,244 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:08:33,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:33,254 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-10-27 06:08:33,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:33,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-10-27 06:08:33,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:33,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 42 transitions. [2018-10-27 06:08:33,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-10-27 06:08:33,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:08:33,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-10-27 06:08:33,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:33,257 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-10-27 06:08:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-10-27 06:08:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-27 06:08:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-27 06:08:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-10-27 06:08:33,259 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-10-27 06:08:33,259 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-10-27 06:08:33,259 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:08:33,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-10-27 06:08:33,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:33,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:33,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:33,260 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:33,260 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:33,260 INFO L793 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 348#L565 assume !(main_~length1~0 < 1); 349#L565-2 assume !(main_~length2~0 < 1); 346#L568-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 347#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 363#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 359#L574 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 339#L552-5 assume true; 341#L552-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L552-1 366#L552-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 350#L554 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L554 351#L554-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 334#L555-9 [2018-10-27 06:08:33,261 INFO L795 eck$LassoCheckResult]: Loop: 334#L555-9 assume true; 343#L555-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-1 354#L555-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 357#L555-3 assume cstrcspn_#t~short7; 361#L555-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-4 364#L555-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 333#L555-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 334#L555-9 [2018-10-27 06:08:33,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-10-27 06:08:33,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-10-27 06:08:33,299 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:33,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:33,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-10-27 06:08:33,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:33,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:33,554 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-10-27 06:08:33,963 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2018-10-27 06:08:34,120 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-10-27 06:08:34,122 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:08:34,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:08:34,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:08:34,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:08:34,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:08:34,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:08:34,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:08:34,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:08:34,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration4_Lasso [2018-10-27 06:08:34,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:08:34,123 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:08:34,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,556 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2018-10-27 06:08:34,681 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-10-27 06:08:34,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:08:34,905 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-10-27 06:08:35,335 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:08:35,361 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:08:35,361 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:08:35,361 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-10-27 06:08:35,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:08:35,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,369 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-10-27 06:08:35,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,371 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-10-27 06:08:35,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,380 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-10-27 06:08:35,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,383 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-10-27 06:08:35,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,392 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-10-27 06:08:35,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:08:35,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:08:35,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:08:35,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,394 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-10-27 06:08:35,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,404 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-10-27 06:08:35,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,414 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-10-27 06:08:35,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,419 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-10-27 06:08:35,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:08:35,427 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-10-27 06:08:35,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:08:35,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:08:35,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:08:35,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:08:35,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:08:35,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:08:35,452 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:08:35,474 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:08:35,474 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:08:35,474 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:08:35,475 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:08:35,476 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:08:35,476 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2018-10-27 06:08:35,578 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-10-27 06:08:35,580 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:08:35,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:08:35,580 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:08:35,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:35,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:35,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:35,727 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:08:35,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:08:35,799 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 89 states and 100 transitions. Complement of second has 10 states. [2018-10-27 06:08:35,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:08:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:08:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-10-27 06:08:35,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 13 letters. Loop has 7 letters. [2018-10-27 06:08:35,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:35,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 20 letters. Loop has 7 letters. [2018-10-27 06:08:35,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:35,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 13 letters. Loop has 14 letters. [2018-10-27 06:08:35,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:08:35,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 100 transitions. [2018-10-27 06:08:35,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:35,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 62 states and 70 transitions. [2018-10-27 06:08:35,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:08:35,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-10-27 06:08:35,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2018-10-27 06:08:35,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:08:35,805 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-10-27 06:08:35,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2018-10-27 06:08:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-10-27 06:08:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:08:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-10-27 06:08:35,807 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-10-27 06:08:35,807 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-10-27 06:08:35,807 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:08:35,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 59 transitions. [2018-10-27 06:08:35,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:08:35,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:08:35,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:08:35,810 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] [2018-10-27 06:08:35,810 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:35,811 INFO L793 eck$LassoCheckResult]: Stem: 656#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 642#L565 assume !(main_~length1~0 < 1); 643#L565-2 assume !(main_~length2~0 < 1); 639#L568-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 640#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 660#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 655#L574 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 631#L552-5 assume true; 632#L552-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L552-1 674#L552-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 646#L554 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L554 647#L554-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 628#L555-9 assume true; 638#L555-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-1 649#L555-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 654#L555-3 assume !cstrcspn_#t~short7; 659#L555-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 641#L555-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-10 635#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 629#L552-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 630#L552-5 assume true; 634#L552-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L552-1 661#L552-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 644#L554 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L554 645#L554-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 626#L555-9 [2018-10-27 06:08:35,811 INFO L795 eck$LassoCheckResult]: Loop: 626#L555-9 assume true; 636#L555-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-1 648#L555-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 653#L555-3 assume cstrcspn_#t~short7; 657#L555-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-4 663#L555-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 625#L555-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 626#L555-9 [2018-10-27 06:08:35,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:35,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2009458362, now seen corresponding path program 2 times [2018-10-27 06:08:35,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:35,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:35,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:35,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:35,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-10-27 06:08:35,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:35,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:35,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:35,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:08:35,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1050967218, now seen corresponding path program 1 times [2018-10-27 06:08:35,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:08:35,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:08:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:08:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:36,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:36,066 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_567da619-32fd-486a-bbc6-4f4f8e0d75e9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:08:36,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:36,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:08:36,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-10-27 06:08:36,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-27 06:08:36,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:08:36,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 06:08:36,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-10-27 06:09:13,589 WARN L179 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 06:09:38,744 WARN L179 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:09:53,337 WARN L179 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:09:53,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-27 06:09:53,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-10-27 06:09:53,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:53,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:53,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:53,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-10-27 06:09:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:53,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:53,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-10-27 06:09:53,600 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-10-27 06:09:53,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 06:09:53,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=222, Unknown=7, NotChecked=0, Total=272 [2018-10-27 06:09:53,601 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. cyclomatic complexity: 10 Second operand 17 states. [2018-10-27 06:09:55,363 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-10-27 06:09:57,543 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-10-27 06:10:01,647 WARN L179 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-10-27 06:10:05,296 WARN L179 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-10-27 06:10:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:05,299 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-10-27 06:10:05,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:10:05,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 121 transitions. [2018-10-27 06:10:05,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:05,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 88 states and 98 transitions. [2018-10-27 06:10:05,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-10-27 06:10:05,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-10-27 06:10:05,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 98 transitions. [2018-10-27 06:10:05,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:05,304 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-10-27 06:10:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 98 transitions. [2018-10-27 06:10:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2018-10-27 06:10:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 06:10:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-10-27 06:10:05,307 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-10-27 06:10:05,307 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-10-27 06:10:05,307 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:05,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2018-10-27 06:10:05,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:05,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:05,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:05,310 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-10-27 06:10:05,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:05,311 INFO L793 eck$LassoCheckResult]: Stem: 956#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 950#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, 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~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 942#L565 assume !(main_~length1~0 < 1); 943#L565-2 assume !(main_~length2~0 < 1); 939#L568-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 940#L573 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L573 960#L573-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L573-1 955#L574 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem4, cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset, cstrcspn_#t~mem5, cstrcspn_#t~mem6, cstrcspn_#t~short7, cstrcspn_#t~mem9, cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 931#L552-5 assume true; 932#L552-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L552-1 974#L552-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 948#L554 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L554 949#L554-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 972#L555-9 assume true; 973#L555-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-1 982#L555-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 958#L555-3 assume cstrcspn_#t~short7; 959#L555-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-4 962#L555-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 966#L555-7 assume !cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7; 941#L555-10 SUMMARY for call cstrcspn_#t~mem9 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-10 935#L557 assume !(cstrcspn_#t~mem9 == cstrcspn_~c~0);havoc cstrcspn_#t~mem9; 929#L552-4 cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset; 930#L552-5 assume true; 934#L552-1 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L552-1 963#L552-2 assume !!(cstrcspn_#t~mem3 != 0);havoc cstrcspn_#t~mem3;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 946#L554 SUMMARY for call cstrcspn_#t~mem4 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L554 947#L554-1 cstrcspn_~c~0 := cstrcspn_#t~mem4;havoc cstrcspn_#t~mem4; 926#L555-9 [2018-10-27 06:10:05,311 INFO L795 eck$LassoCheckResult]: Loop: 926#L555-9 assume true; 936#L555-1 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-1 944#L555-2 cstrcspn_#t~short7 := cstrcspn_#t~mem5 != 0; 951#L555-3 assume cstrcspn_#t~short7; 957#L555-4 SUMMARY for call cstrcspn_#t~mem6 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L555-4 961#L555-5 cstrcspn_#t~short7 := cstrcspn_#t~mem6 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 925#L555-7 assume !!cstrcspn_#t~short7;havoc cstrcspn_#t~mem6;havoc cstrcspn_#t~mem5;havoc cstrcspn_#t~short7;cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset + 1;havoc cstrcspn_#t~post8.base, cstrcspn_#t~post8.offset; 926#L555-9 [2018-10-27 06:10:05,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:05,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 1 times [2018-10-27 06:10:05,311 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:05,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:05,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:05,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:05,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:05,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:05,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 3 times [2018-10-27 06:10:05,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:05,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:05,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:05,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-10-27 06:10:05,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:05,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:05,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:05,939 WARN L179 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 148 [2018-10-27 06:10:06,724 WARN L179 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 119 [2018-10-27 06:10:06,726 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:06,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:06,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:06,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:06,726 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:06,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:06,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:06,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:06,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn-alloca_true-termination.c.i_Iteration6_Lasso [2018-10-27 06:10:06,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:06,726 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:06,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:06,935 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 06:10:07,613 WARN L179 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2018-10-27 06:10:07,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:07,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:08,684 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-10-27 06:10:08,792 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-10-27 06:10:08,813 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:08,814 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:08,814 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-10-27 06:10:08,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,820 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-10-27 06:10:08,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,828 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-10-27 06:10:08,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,830 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-10-27 06:10:08,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,831 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-10-27 06:10:08,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,833 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-10-27 06:10:08,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,836 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-10-27 06:10:08,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,837 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-10-27 06:10:08,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,839 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-10-27 06:10:08,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,841 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-10-27 06:10:08,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,843 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-10-27 06:10:08,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,845 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-10-27 06:10:08,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,846 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-10-27 06:10:08,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,864 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-10-27 06:10:08,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,866 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-10-27 06:10:08,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:08,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:08,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:08,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,868 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-10-27 06:10:08,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,872 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-10-27 06:10:08,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,875 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-10-27 06:10:08,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,891 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-10-27 06:10:08,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,894 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-10-27 06:10:08,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,895 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:08,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,896 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:08,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,915 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-10-27 06:10:08,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,916 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:08,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,917 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:08,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,923 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-10-27 06:10:08,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,941 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-10-27 06:10:08,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,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-10-27 06:10:08,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:08,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:08,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-10-27 06:10:08,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:08,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:08,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:08,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:08,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:08,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:09,000 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:09,030 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:10:09,033 INFO L444 ModelExtractionUtils]: 28 out of 37 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:10:09,033 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:09,034 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:09,034 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:09,034 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1) = -1*ULTIMATE.start_cstrcspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 Supporting invariants [] [2018-10-27 06:10:09,726 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-10-27 06:10:09,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:09,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:09,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:09,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:09,882 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-10-27 06:10:09,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-10-27 06:10:09,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 92 states and 104 transitions. Complement of second has 9 states. [2018-10-27 06:10:09,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-10-27 06:10:09,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:10:09,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:09,941 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:09,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:09,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:10,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:10,048 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-10-27 06:10:10,048 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-10-27 06:10:10,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 92 states and 104 transitions. Complement of second has 9 states. [2018-10-27 06:10:10,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-10-27 06:10:10,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:10:10,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:10,188 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:10:10,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:10,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:10,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:10,272 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-10-27 06:10:10,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-10-27 06:10:10,357 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 99 states and 114 transitions. Complement of second has 8 states. [2018-10-27 06:10:10,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-10-27 06:10:10,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 28 letters. Loop has 7 letters. [2018-10-27 06:10:10,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:10,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 35 letters. Loop has 7 letters. [2018-10-27 06:10:10,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:10,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 45 transitions. Stem has 28 letters. Loop has 14 letters. [2018-10-27 06:10:10,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:10,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 114 transitions. [2018-10-27 06:10:10,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:10,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. [2018-10-27 06:10:10,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:10:10,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:10:10,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:10:10,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:10:10,363 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:10,363 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:10,363 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:10:10,363 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:10,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:10:10,371 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:10:10,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:10:10,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:10:10 BoogieIcfgContainer [2018-10-27 06:10:10,376 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:10:10,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:10:10,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:10:10,377 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:10:10,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:29" (3/4) ... [2018-10-27 06:10:10,380 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:10:10,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:10:10,382 INFO L168 Benchmark]: Toolchain (without parser) took 101667.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.7 MB). Free memory was 951.8 MB in the beginning and 1.3 GB in the end (delta: -315.5 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:10,383 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:10,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:10,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -257.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:10,384 INFO L168 Benchmark]: Boogie Preprocessor took 23.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:10,385 INFO L168 Benchmark]: RCFGBuilder took 498.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:10,385 INFO L168 Benchmark]: BuchiAutomizer took 100687.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -108.0 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:10:10,386 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:10:10,389 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.62 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 930.3 MB in the beginning and 1.2 GB in the end (delta: -257.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 498.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 100687.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -108.0 MB). Peak memory consumption was 72.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - 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 unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString2] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 100.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 87.6s. Construction of modules took 0.3s. Büchi inclusion checks took 12.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 60 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 200 SDtfs, 384 SDslu, 313 SDs, 0 SdLazy, 279 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital353 mio100 ax106 hnf99 lsp85 ukn92 mio100 lsp31 div115 bol100 ite100 ukn100 eq184 hnf82 smp86 dnf760 smp50 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 6 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...