./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/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 32bit --witnessprinter.graph.data.programhash 0116566dfd4e4e63b59200ee97d098541aa6c54d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:11:24,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:11:24,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:11:24,167 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:11:24,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:11:24,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:11:24,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:11:24,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:11:24,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:11:24,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:11:24,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:11:24,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:11:24,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:11:24,176 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:11:24,177 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:11:24,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:11:24,178 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:11:24,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:11:24,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:11:24,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:11:24,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:11:24,184 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:11:24,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:11:24,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:11:24,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:11:24,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:11:24,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:11:24,189 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:11:24,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:11:24,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:11:24,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:11:24,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:11:24,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:11:24,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:11:24,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:11:24,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:11:24,193 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:11:24,206 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:11:24,206 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:11:24,207 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:11:24,207 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:11:24,207 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:11:24,208 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:11:24,208 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:11:24,208 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:11:24,208 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:11:24,208 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:11:24,208 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:11:24,209 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:11:24,209 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:11:24,209 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:11:24,209 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:11:24,209 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:11:24,209 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:11:24,210 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:11:24,210 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:11:24,210 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:11:24,210 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:11:24,210 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:11:24,210 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:11:24,210 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:11:24,211 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:11:24,213 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:11:24,213 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:11:24,213 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:11:24,213 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:11:24,213 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:11:24,214 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:11:24,214 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_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0116566dfd4e4e63b59200ee97d098541aa6c54d [2018-10-27 06:11:24,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:11:24,247 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:11:24,250 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:11:24,251 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:11:24,252 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:11:24,252 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:11:24,295 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/data/e88d2bd31/e17b15d8d0704c6c8f54fe1a050fa04d/FLAG785fc5c30 [2018-10-27 06:11:24,720 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:11:24,721 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/sv-benchmarks/c/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:11:24,731 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/data/e88d2bd31/e17b15d8d0704c6c8f54fe1a050fa04d/FLAG785fc5c30 [2018-10-27 06:11:24,742 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/bin-2019/uautomizer/data/e88d2bd31/e17b15d8d0704c6c8f54fe1a050fa04d [2018-10-27 06:11:24,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:11:24,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:11:24,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:24,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:11:24,753 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:11:24,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@278a42f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:24, skipping insertion in model container [2018-10-27 06:11:24,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:11:24" (1/1) ... [2018-10-27 06:11:24,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:11:24,794 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:11:25,003 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:25,013 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:11:25,052 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:11:25,086 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:11:25,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25 WrapperNode [2018-10-27 06:11:25,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:11:25,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:25,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:11:25,087 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:11:25,094 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:11:25" (1/1) ... [2018-10-27 06:11:25,107 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:11:25" (1/1) ... [2018-10-27 06:11:25,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:11:25,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:11:25,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:11:25,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:11:25,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25" (1/1) ... [2018-10-27 06:11:25,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25" (1/1) ... [2018-10-27 06:11:25,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25" (1/1) ... [2018-10-27 06:11:25,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25" (1/1) ... [2018-10-27 06:11:25,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25" (1/1) ... [2018-10-27 06:11:25,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25" (1/1) ... [2018-10-27 06:11:25,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25" (1/1) ... [2018-10-27 06:11:25,234 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:11:25,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:11:25,235 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:11:25,235 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:11:25,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60b0aa2c-dc5c-4d76-a89d-0ea385db73e5/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:11:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:11:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:11:25,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:11:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:11:25,815 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:11:25,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:25 BoogieIcfgContainer [2018-10-27 06:11:25,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:11:25,816 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:11:25,816 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:11:25,820 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:11:25,820 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:25,820 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:11:24" (1/3) ... [2018-10-27 06:11:25,821 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46af944c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:25, skipping insertion in model container [2018-10-27 06:11:25,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:25,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:11:25" (2/3) ... [2018-10-27 06:11:25,822 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46af944c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:11:25, skipping insertion in model container [2018-10-27 06:11:25,822 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:11:25,822 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:25" (3/3) ... [2018-10-27 06:11:25,823 INFO L375 chiAutomizerObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-10-27 06:11:25,870 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:11:25,870 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:11:25,870 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:11:25,871 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:11:25,871 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:11:25,871 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:11:25,871 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:11:25,871 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:11:25,871 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:11:25,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-10-27 06:11:25,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:11:25,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:25,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:25,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:25,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:25,916 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:11:25,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2018-10-27 06:11:25,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:11:25,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:25,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:25,919 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:25,919 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:11:25,926 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 18#L558true assume !(main_~length1~0 < 1); 22#L558-2true assume !(main_~length2~0 < 1); 15#L561-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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 5#L566true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 7#L566-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 20#L567true assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 14#L543-4true [2018-10-27 06:11:25,926 INFO L795 eck$LassoCheckResult]: Loop: 14#L543-4true assume true; 10#L543-1true SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 11#L543-2true assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 19#L546-10true assume !true; 21#L546-11true SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-11 13#L550true assume !(substring_#t~mem9 == 0);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 14#L543-4true [2018-10-27 06:11:25,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:25,931 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-10-27 06:11:25,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:25,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:25,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:25,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:25,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1540425151, now seen corresponding path program 1 times [2018-10-27 06:11:26,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:26,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:26,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:26,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:26,113 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:11:26,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:26,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:11:26,122 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:26,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:11:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:11:26,139 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-10-27 06:11:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:26,145 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-10-27 06:11:26,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:11:26,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-10-27 06:11:26,148 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:11:26,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 21 states and 25 transitions. [2018-10-27 06:11:26,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:11:26,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:11:26,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-10-27 06:11:26,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:26,153 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-27 06:11:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-10-27 06:11:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 06:11:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 06:11:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-10-27 06:11:26,180 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-27 06:11:26,181 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-10-27 06:11:26,181 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:11:26,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-10-27 06:11:26,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-10-27 06:11:26,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:26,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:26,182 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:26,182 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:26,182 INFO L793 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 75#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 60#L558 assume !(main_~length1~0 < 1); 61#L558-2 assume !(main_~length2~0 < 1); 68#L561-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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 70#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 71#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 64#L567 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 65#L543-4 [2018-10-27 06:11:26,183 INFO L795 eck$LassoCheckResult]: Loop: 65#L543-4 assume true; 76#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 77#L543-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 62#L546-10 assume true; 63#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 69#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 72#L546-3 assume !substring_#t~short6; 74#L546-8 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4; 66#L546-11 SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-11 67#L550 assume !(substring_#t~mem9 == 0);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 65#L543-4 [2018-10-27 06:11:26,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:26,184 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-10-27 06:11:26,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:26,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:26,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:26,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:26,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1301820241, now seen corresponding path program 1 times [2018-10-27 06:11:26,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:26,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:26,386 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:11:26,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:26,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:11:26,387 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:26,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:11:26,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:11:26,387 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-10-27 06:11:26,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:26,677 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-10-27 06:11:26,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:11:26,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-10-27 06:11:26,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:11:26,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 26 transitions. [2018-10-27 06:11:26,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-10-27 06:11:26,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-10-27 06:11:26,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-10-27 06:11:26,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:26,681 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-10-27 06:11:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-10-27 06:11:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-27 06:11:26,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-27 06:11:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-10-27 06:11:26,683 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-10-27 06:11:26,685 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-10-27 06:11:26,685 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:11:26,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-10-27 06:11:26,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-10-27 06:11:26,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:26,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:26,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:26,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:26,686 INFO L793 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 120#L558 assume !(main_~length1~0 < 1); 121#L558-2 assume !(main_~length2~0 < 1); 128#L561-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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 130#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 131#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 124#L567 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 125#L543-4 [2018-10-27 06:11:26,687 INFO L795 eck$LassoCheckResult]: Loop: 125#L543-4 assume true; 136#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 137#L543-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 122#L546-10 assume true; 123#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 129#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 132#L546-3 assume substring_#t~short6; 133#L546-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-4 138#L546-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L546-5 140#L546-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 141#L546-8 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4; 126#L546-11 SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-11 127#L550 assume !(substring_#t~mem9 == 0);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 125#L543-4 [2018-10-27 06:11:26,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:26,687 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-10-27 06:11:26,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:26,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:26,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:26,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1411931925, now seen corresponding path program 1 times [2018-10-27 06:11:26,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:26,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:26,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:26,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1729135105, now seen corresponding path program 1 times [2018-10-27 06:11:26,758 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:26,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:26,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:26,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:27,088 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2018-10-27 06:11:27,300 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-10-27 06:11:27,621 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-10-27 06:11:27,758 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-10-27 06:11:27,768 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:27,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:27,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:27,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:27,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:27,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:27,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:27,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:27,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-10-27 06:11:27,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:27,770 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:27,791 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:11:27,815 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:11:27,817 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:11:27,821 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:11:27,824 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:11:27,835 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:11:27,860 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:11:27,862 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:11:27,867 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:11:27,869 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:11:27,871 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:11:27,872 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:11:27,875 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:11:27,877 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:11:27,878 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:11:27,880 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:11:27,881 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:11:27,883 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:11:28,199 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-10-27 06:11:28,376 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-10-27 06:11:28,377 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:11:28,379 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:11:28,872 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:28,877 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:28,878 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:11:28,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,883 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,884 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:11:28,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,886 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:11:28,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:28,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:28,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,895 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:11:28,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,899 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:11:28,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:28,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:28,907 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,907 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:11:28,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,909 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:11:28,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,916 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:11:28,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,918 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,918 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:11:28,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,924 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:11:28,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,926 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:11:28,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:28,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,938 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:11:28,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,940 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,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:11:28,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:28,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,951 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:11:28,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:28,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:28,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:28,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,955 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:11:28,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,963 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:28,963 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:28,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:28,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:28,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:28,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,987 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:11:28,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:28,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:28,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:28,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:28,994 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:11:28,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:28,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:28,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:28,995 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-10-27 06:11:28,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:28,997 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:11:28,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:29,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:29,011 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:11:29,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:29,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:29,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:29,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:29,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:29,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:29,048 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:29,086 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:11:29,086 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:11:29,088 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:29,089 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:29,090 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:29,090 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_substring_~ps~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_substring_~ps~0.offset Supporting invariants [] [2018-10-27 06:11:29,156 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:11:29,163 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:29,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:29,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:29,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:29,309 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:11:29,312 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:11:29,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-10-27 06:11:29,399 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 36 states and 43 transitions. Complement of second has 7 states. [2018-10-27 06:11:29,400 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:11:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-27 06:11:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-10-27 06:11:29,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 13 letters. [2018-10-27 06:11:29,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:29,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 21 letters. Loop has 13 letters. [2018-10-27 06:11:29,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:29,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 8 letters. Loop has 26 letters. [2018-10-27 06:11:29,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:29,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2018-10-27 06:11:29,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-10-27 06:11:29,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 41 transitions. [2018-10-27 06:11:29,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-10-27 06:11:29,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-10-27 06:11:29,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2018-10-27 06:11:29,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:29,406 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-10-27 06:11:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2018-10-27 06:11:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-27 06:11:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-27 06:11:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-10-27 06:11:29,410 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-10-27 06:11:29,411 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-10-27 06:11:29,411 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:11:29,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2018-10-27 06:11:29,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:11:29,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:29,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:29,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:29,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:11:29,413 INFO L793 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 308#L558 assume !(main_~length1~0 < 1); 309#L558-2 assume !(main_~length2~0 < 1); 318#L561-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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 321#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 322#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 314#L567 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 315#L543-4 assume true; 330#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 331#L543-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 310#L546-10 [2018-10-27 06:11:29,414 INFO L795 eck$LassoCheckResult]: Loop: 310#L546-10 assume true; 311#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 319#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 323#L546-3 assume !substring_#t~short6; 326#L546-8 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, substring_#t~post7.offset + 1;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, substring_#t~post8.offset + 1;havoc substring_#t~post8.base, substring_#t~post8.offset; 310#L546-10 [2018-10-27 06:11:29,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2052451984, now seen corresponding path program 1 times [2018-10-27 06:11:29,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:29,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,434 INFO L82 PathProgramCache]: Analyzing trace with hash 60184039, now seen corresponding path program 1 times [2018-10-27 06:11:29,434 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:29,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:29,495 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:11:29,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:11:29,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:11:29,496 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:11:29,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:11:29,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:11:29,496 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-10-27 06:11:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:29,554 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-10-27 06:11:29,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:11:29,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-10-27 06:11:29,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:11:29,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 32 states and 37 transitions. [2018-10-27 06:11:29,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-10-27 06:11:29,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-10-27 06:11:29,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2018-10-27 06:11:29,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:29,557 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-10-27 06:11:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2018-10-27 06:11:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-27 06:11:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 06:11:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-10-27 06:11:29,559 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-10-27 06:11:29,559 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-10-27 06:11:29,559 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:11:29,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2018-10-27 06:11:29,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:11:29,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:29,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:29,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:29,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:29,560 INFO L793 eck$LassoCheckResult]: Stem: 407#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 381#L558 assume !(main_~length1~0 < 1); 382#L558-2 assume !(main_~length2~0 < 1); 391#L561-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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 394#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 395#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 387#L567 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 388#L543-4 assume true; 401#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 402#L543-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 383#L546-10 [2018-10-27 06:11:29,561 INFO L795 eck$LassoCheckResult]: Loop: 383#L546-10 assume true; 384#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 392#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 396#L546-3 assume substring_#t~short6; 398#L546-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-4 405#L546-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L546-5 408#L546-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 410#L546-8 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, substring_#t~post7.offset + 1;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, substring_#t~post8.offset + 1;havoc substring_#t~post8.base, substring_#t~post8.offset; 383#L546-10 [2018-10-27 06:11:29,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2052451984, now seen corresponding path program 2 times [2018-10-27 06:11:29,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:29,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1936468655, now seen corresponding path program 1 times [2018-10-27 06:11:29,607 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:29,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash 976099902, now seen corresponding path program 1 times [2018-10-27 06:11:29,624 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:29,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:30,432 WARN L179 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-10-27 06:11:30,753 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-10-27 06:11:30,860 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-10-27 06:11:30,862 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:30,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:30,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:30,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:30,862 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:30,862 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:30,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:30,862 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:30,862 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-10-27 06:11:30,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:30,863 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:30,865 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:11:30,872 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:11:30,874 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:11:30,875 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:11:30,877 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:11:30,878 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:11:30,880 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:11:30,881 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:11:30,882 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:11:30,884 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:11:30,885 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:11:30,887 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:11:30,888 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:11:30,890 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:11:30,891 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:11:30,892 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:11:30,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:30,895 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:11:31,210 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 104 [2018-10-27 06:11:31,418 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-10-27 06:11:31,418 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:11:31,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:31,975 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:31,976 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:31,976 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:11:31,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:31,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:31,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:31,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:31,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:31,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:31,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:31,979 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:31,982 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:11:31,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:31,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:31,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:31,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:31,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:31,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:31,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:31,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:31,985 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:11:31,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:31,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:31,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:31,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:31,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:31,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:31,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:31,994 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:11:31,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:31,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:31,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:31,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:31,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:31,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:31,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:31,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:31,996 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:11:31,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:31,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:31,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:31,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:31,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:31,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:31,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:31,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:31,998 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:11:31,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:31,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:31,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:31,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:31,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:31,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:31,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,009 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:11:32,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,010 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,010 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:11:32,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,012 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:11:32,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,014 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:11:32,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,028 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:11:32,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:32,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:32,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,031 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:11:32,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,033 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:11:32,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,035 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:11:32,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,037 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:11:32,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,038 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:11:32,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:32,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:32,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:32,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:32,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,054 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:11:32,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:32,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:32,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,058 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:11:32,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:32,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:32,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:32,061 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:11:32,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:32,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:32,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:32,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:32,078 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:32,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:32,125 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:32,152 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:11:32,152 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:11:32,152 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:32,153 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:32,153 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:32,153 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-10-27 06:11:32,342 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-10-27 06:11:32,344 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:11:32,344 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:32,345 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:11:32,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:32,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:32,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:32,530 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:11:32,530 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:11:32,531 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-10-27 06:11:32,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 37 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 81 states and 89 transitions. Complement of second has 9 states. [2018-10-27 06:11:32,624 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:11:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-10-27 06:11:32,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 11 letters. Loop has 8 letters. [2018-10-27 06:11:32,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:32,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 19 letters. Loop has 8 letters. [2018-10-27 06:11:32,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:32,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 11 letters. Loop has 16 letters. [2018-10-27 06:11:32,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:32,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2018-10-27 06:11:32,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:11:32,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 56 states and 62 transitions. [2018-10-27 06:11:32,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:11:32,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:11:32,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2018-10-27 06:11:32,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:32,627 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-10-27 06:11:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2018-10-27 06:11:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2018-10-27 06:11:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-27 06:11:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-10-27 06:11:32,632 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-10-27 06:11:32,632 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-10-27 06:11:32,632 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:11:32,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 54 transitions. [2018-10-27 06:11:32,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-10-27 06:11:32,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:32,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:32,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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:11:32,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:32,634 INFO L793 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 691#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~ret15, 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~nondet11;havoc main_#t~nondet11;main_~length2~0 := main_#t~nondet12;havoc main_#t~nondet12; 671#L558 assume !(main_~length1~0 < 1); 672#L558-2 assume !(main_~length2~0 < 1); 682#L561-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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.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~malloc14.base, main_#t~malloc14.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~malloc14.base, main_#t~malloc14.offset; 685#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 686#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 680#L567 assume { :begin_inline_substring } true;substring_#in~s.base, substring_#in~s.offset, substring_#in~t.base, substring_#in~t.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc substring_#res;havoc substring_#t~post7.base, substring_#t~post7.offset, substring_#t~post8.base, substring_#t~post8.offset, substring_#t~mem3, substring_#t~mem4, substring_#t~mem5, substring_#t~short6, substring_#t~mem9, substring_#t~post10.base, substring_#t~post10.offset, substring_~ps2~0.base, substring_~ps2~0.offset, substring_~pt~0.base, substring_~pt~0.offset, substring_#t~mem2, substring_~s.base, substring_~s.offset, substring_~t.base, substring_~t.offset, substring_~ps~0.base, substring_~ps~0.offset;substring_~s.base, substring_~s.offset := substring_#in~s.base, substring_#in~s.offset;substring_~t.base, substring_~t.offset := substring_#in~t.base, substring_#in~t.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_~s.base, substring_~s.offset; 681#L543-4 assume true; 706#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 700#L543-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 675#L546-10 assume true; 677#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 684#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 688#L546-3 assume substring_#t~short6; 690#L546-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-4 713#L546-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L546-5 711#L546-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 707#L546-8 assume !substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4; 678#L546-11 SUMMARY for call substring_#t~mem9 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-11 679#L550 assume !(substring_#t~mem9 == 0);havoc substring_#t~mem9;substring_#t~post10.base, substring_#t~post10.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~ps~0.base, substring_~ps~0.offset := substring_#t~post10.base, substring_#t~post10.offset + 1;havoc substring_#t~post10.base, substring_#t~post10.offset; 705#L543-4 assume true; 692#L543-1 SUMMARY for call substring_#t~mem2 := read~int(substring_~ps~0.base, substring_~ps~0.offset, 1); srcloc: L543-1 693#L543-2 assume !!(substring_#t~mem2 != 0);havoc substring_#t~mem2;substring_~ps2~0.base, substring_~ps2~0.offset := substring_~ps~0.base, substring_~ps~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_~t.base, substring_~t.offset; 673#L546-10 [2018-10-27 06:11:32,634 INFO L795 eck$LassoCheckResult]: Loop: 673#L546-10 assume true; 674#L546-1 SUMMARY for call substring_#t~mem3 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-1 683#L546-2 substring_#t~short6 := substring_#t~mem3 != 0; 687#L546-3 assume substring_#t~short6; 689#L546-4 SUMMARY for call substring_#t~mem4 := read~int(substring_~pt~0.base, substring_~pt~0.offset, 1); srcloc: L546-4 696#L546-5 SUMMARY for call substring_#t~mem5 := read~int(substring_~ps2~0.base, substring_~ps2~0.offset, 1); srcloc: L546-5 701#L546-6 substring_#t~short6 := substring_#t~mem4 == substring_#t~mem5; 703#L546-8 assume !!substring_#t~short6;havoc substring_#t~mem5;havoc substring_#t~short6;havoc substring_#t~mem3;havoc substring_#t~mem4;substring_#t~post7.base, substring_#t~post7.offset := substring_~pt~0.base, substring_~pt~0.offset;substring_~pt~0.base, substring_~pt~0.offset := substring_#t~post7.base, substring_#t~post7.offset + 1;havoc substring_#t~post7.base, substring_#t~post7.offset;substring_#t~post8.base, substring_#t~post8.offset := substring_~ps2~0.base, substring_~ps2~0.offset;substring_~ps2~0.base, substring_~ps2~0.offset := substring_#t~post8.base, substring_#t~post8.offset + 1;havoc substring_#t~post8.base, substring_#t~post8.offset; 673#L546-10 [2018-10-27 06:11:32,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1173813254, now seen corresponding path program 2 times [2018-10-27 06:11:32,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:32,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:32,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1936468655, now seen corresponding path program 2 times [2018-10-27 06:11:32,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:32,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:32,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:32,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:32,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash 705571240, now seen corresponding path program 1 times [2018-10-27 06:11:32,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:32,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:32,847 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-10-27 06:11:33,308 WARN L179 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 147 [2018-10-27 06:11:33,446 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 06:11:33,452 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:33,452 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:33,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:33,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:33,453 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:33,453 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:33,453 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:33,453 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:33,453 INFO L131 ssoRankerPreferences]: Filename of dumped script: substring-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-10-27 06:11:33,453 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:33,453 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:33,456 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:11:33,462 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:11:33,463 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:11:33,467 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:11:33,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:33,469 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:11:33,471 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:11:33,475 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:11:33,477 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:11:34,214 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 123 [2018-10-27 06:11:34,409 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-10-27 06:11:34,409 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:11:34,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,412 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:11:34,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,415 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:11:34,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,418 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:11:34,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,421 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:11:34,423 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:11:34,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:34,428 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:11:34,629 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-10-27 06:11:35,049 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-10-27 06:11:35,212 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-10-27 06:11:35,356 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:35,356 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:35,356 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:11:35,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,358 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:11:35,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,366 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:11:35,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:35,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,374 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:11:35,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,376 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:11:35,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,377 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:11:35,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11: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:11:35,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:35,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:35,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:35,393 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,393 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:11:35,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,396 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:11:35,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,398 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:11:35,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,413 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:11:35,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,413 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-10-27 06:11:35,413 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:11:35,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,427 INFO L402 nArgumentSynthesizer]: We have 60 Motzkin's Theorem applications. [2018-10-27 06:11:35,427 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:11:35,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,456 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:11:35,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,457 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:35,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,458 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:35,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:35,468 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:11:35,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:35,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:35,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:35,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:35,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:35,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:35,522 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:35,563 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-10-27 06:11:35,563 INFO L444 ModelExtractionUtils]: 60 out of 67 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:11:35,564 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:35,564 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:35,565 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:35,565 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3, ULTIMATE.start_substring_~pt~0.offset) = 1*v_rep(select #length ULTIMATE.start_substring_~pt~0.base)_3 - 1*ULTIMATE.start_substring_~pt~0.offset Supporting invariants [] [2018-10-27 06:11:35,974 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-10-27 06:11:35,975 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:35,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:35,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:36,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:36,015 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:11:36,016 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:11:36,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:11:36,037 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 77 states and 83 transitions. Complement of second has 7 states. [2018-10-27 06:11:36,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-10-27 06:11:36,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 24 letters. Loop has 8 letters. [2018-10-27 06:11:36,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:36,040 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:36,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:36,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:36,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:36,083 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:11:36,083 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:11:36,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:11:36,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 77 states and 83 transitions. Complement of second has 7 states. [2018-10-27 06:11:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2018-10-27 06:11:36,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 24 letters. Loop has 8 letters. [2018-10-27 06:11:36,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:36,100 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:36,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:36,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:36,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:36,157 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:11:36,158 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-10-27 06:11:36,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-10-27 06:11:36,176 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 54 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 85 states and 92 transitions. Complement of second has 6 states. [2018-10-27 06:11:36,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:11:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-10-27 06:11:36,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 24 letters. Loop has 8 letters. [2018-10-27 06:11:36,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:36,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 32 letters. Loop has 8 letters. [2018-10-27 06:11:36,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:36,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 38 transitions. Stem has 24 letters. Loop has 16 letters. [2018-10-27 06:11:36,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:36,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-10-27 06:11:36,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:36,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-10-27 06:11:36,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:36,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:36,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:36,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:36,182 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:36,182 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:36,182 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:36,182 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:11:36,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:36,182 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:36,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:11:36,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:36 BoogieIcfgContainer [2018-10-27 06:11:36,191 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:36,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:36,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:36,191 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:36,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:11:25" (3/4) ... [2018-10-27 06:11:36,197 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:11:36,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:36,197 INFO L168 Benchmark]: Toolchain (without parser) took 11453.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 951.7 MB in the beginning and 932.3 MB in the end (delta: 19.5 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:36,198 INFO L168 Benchmark]: CDTParser took 0.20 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:11:36,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 928.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:36,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -211.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:36,199 INFO L168 Benchmark]: Boogie Preprocessor took 31.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:36,199 INFO L168 Benchmark]: RCFGBuilder took 581.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:36,200 INFO L168 Benchmark]: BuchiAutomizer took 10375.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 932.3 MB in the end (delta: 176.2 MB). Peak memory consumption was 250.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:36,200 INFO L168 Benchmark]: Witness Printer took 5.47 ms. Allocated memory is still 1.2 GB. Free memory is still 932.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:36,203 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.20 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 336.56 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 928.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 115.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 928.9 MB in the beginning and 1.1 GB in the end (delta: -211.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 581.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10375.05 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 932.3 MB in the end (delta: 176.2 MB). Peak memory consumption was 250.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.47 ms. Allocated memory is still 1.2 GB. Free memory is still 932.3 MB. 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 * ps and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * pt and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[pt] + -1 * pt and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 9.0s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 49 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 182 SDtfs, 193 SDslu, 105 SDs, 0 SdLazy, 113 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax100 hnf99 lsp97 ukn104 mio100 lsp37 div100 bol100 ite100 ukn100 eq200 hnf87 smp97 dnf157 smp78 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 12 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 60 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...