./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/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 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:13:04,217 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:13:04,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:13:04,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:13:04,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:13:04,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:13:04,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:13:04,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:13:04,230 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:13:04,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:13:04,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:13:04,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:13:04,232 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:13:04,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:13:04,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:13:04,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:13:04,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:13:04,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:13:04,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:13:04,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:13:04,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:13:04,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:13:04,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:13:04,241 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:13:04,241 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:13:04,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:13:04,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:13:04,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:13:04,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:13:04,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:13:04,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:13:04,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:13:04,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:13:04,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:13:04,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:13:04,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:13:04,247 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 10:13:04,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:13:04,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:13:04,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:13:04,259 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:13:04,259 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:13:04,259 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:13:04,259 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:13:04,259 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:13:04,259 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:13:04,259 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:13:04,260 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:13:04,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:13:04,260 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:13:04,260 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:13:04,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:13:04,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:13:04,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:13:04,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:13:04,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:13:04,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:13:04,261 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:13:04,261 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:13:04,261 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:13:04,261 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:13:04,261 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:13:04,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:13:04,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:13:04,262 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:13:04,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:13:04,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:13:04,264 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:13:04,265 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:13:04,266 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_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/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 -> 61682d2c31dd7110d61be8ccb8e4bbb3882eca20 [2018-11-18 10:13:04,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:13:04,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:13:04,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:13:04,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:13:04,296 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:13:04,296 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:13:04,329 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/data/a71c2be7e/a0f066bb11044a6ab2facb3fefc9be78/FLAGe283b78ea [2018-11-18 10:13:04,745 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:13:04,745 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/sv-benchmarks/c/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:13:04,751 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/data/a71c2be7e/a0f066bb11044a6ab2facb3fefc9be78/FLAGe283b78ea [2018-11-18 10:13:04,759 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/data/a71c2be7e/a0f066bb11044a6ab2facb3fefc9be78 [2018-11-18 10:13:04,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:13:04,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:13:04,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:13:04,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:13:04,764 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:13:04,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:13:04" (1/1) ... [2018-11-18 10:13:04,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@525215d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:04, skipping insertion in model container [2018-11-18 10:13:04,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:13:04" (1/1) ... [2018-11-18 10:13:04,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:13:04,796 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:13:04,971 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:13:04,978 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:13:05,047 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:13:05,075 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:13:05,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05 WrapperNode [2018-11-18 10:13:05,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:13:05,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:13:05,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:13:05,076 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:13:05,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... [2018-11-18 10:13:05,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... [2018-11-18 10:13:05,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:13:05,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:13:05,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:13:05,102 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:13:05,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... [2018-11-18 10:13:05,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... [2018-11-18 10:13:05,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... [2018-11-18 10:13:05,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... [2018-11-18 10:13:05,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... [2018-11-18 10:13:05,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... [2018-11-18 10:13:05,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... [2018-11-18 10:13:05,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:13:05,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:13:05,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:13:05,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:13:05,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e51c6b3f-d683-49e4-9fa4-be90526f2d2b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:13:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:13:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:13:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:13:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:13:05,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:13:05,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:13:05,346 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:13:05,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:13:05 BoogieIcfgContainer [2018-11-18 10:13:05,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:13:05,347 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:13:05,347 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:13:05,350 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:13:05,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:13:05,351 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:13:04" (1/3) ... [2018-11-18 10:13:05,351 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa7741f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:13:05, skipping insertion in model container [2018-11-18 10:13:05,351 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:13:05,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:13:05" (2/3) ... [2018-11-18 10:13:05,352 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1fa7741f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:13:05, skipping insertion in model container [2018-11-18 10:13:05,352 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:13:05,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:13:05" (3/3) ... [2018-11-18 10:13:05,353 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-11-18 10:13:05,388 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:13:05,388 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:13:05,389 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:13:05,389 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:13:05,389 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:13:05,389 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:13:05,389 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:13:05,389 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:13:05,389 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:13:05,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 10:13:05,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 10:13:05,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:13:05,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:13:05,419 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 10:13:05,419 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:13:05,419 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:13:05,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-18 10:13:05,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 10:13:05,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:13:05,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:13:05,421 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 10:13:05,421 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 10:13:05,426 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4#L558true assume !(main_~length1~0 < 1); 7#L558-2true assume !(main_~length2~0 < 1); 20#L561-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 15#L545-4true [2018-11-18 10:13:05,426 INFO L796 eck$LassoCheckResult]: Loop: 15#L545-4true assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 8#L545-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 12#L548-6true assume !true; 16#L548-7true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 19#L550true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 13#L545-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 15#L545-4true [2018-11-18 10:13:05,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:05,430 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-18 10:13:05,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:05,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:13:05,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:05,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:05,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1454947914, now seen corresponding path program 1 times [2018-11-18 10:13:05,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:05,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:13:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:13:05,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:13:05,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 10:13:05,555 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:13:05,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 10:13:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 10:13:05,567 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-18 10:13:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:13:05,571 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-11-18 10:13:05,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 10:13:05,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-18 10:13:05,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 10:13:05,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 18 transitions. [2018-11-18 10:13:05,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 10:13:05,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 10:13:05,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2018-11-18 10:13:05,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:13:05,577 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 10:13:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2018-11-18 10:13:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 10:13:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 10:13:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-18 10:13:05,593 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 10:13:05,593 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-18 10:13:05,593 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:13:05,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-18 10:13:05,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-18 10:13:05,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:13:05,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:13:05,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 10:13:05,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:13:05,595 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 55#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 46#L558 assume !(main_~length1~0 < 1); 47#L558-2 assume !(main_~length2~0 < 1); 51#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 57#L545-4 [2018-11-18 10:13:05,595 INFO L796 eck$LassoCheckResult]: Loop: 57#L545-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 52#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 53#L548-6 assume true; 48#L548-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 49#L548-2 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 50#L548-4 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 54#L548-7 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 59#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 56#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 57#L545-4 [2018-11-18 10:13:05,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-18 10:13:05,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:05,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:05,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:13:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:05,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:05,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1329778143, now seen corresponding path program 1 times [2018-11-18 10:13:05,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:05,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:05,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:13:05,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:05,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 152793724, now seen corresponding path program 1 times [2018-11-18 10:13:05,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:05,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:05,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:13:05,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:05,842 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-18 10:13:06,045 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-18 10:13:06,208 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-18 10:13:06,273 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:13:06,274 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:13:06,274 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:13:06,275 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:13:06,275 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:13:06,275 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:13:06,275 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:13:06,275 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:13:06,275 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-18 10:13:06,276 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:13:06,276 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:13:06,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:06,957 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:13:06,960 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:13:06,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,967 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:06,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:06,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,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-11-18 10:13:06,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,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-11-18 10:13:06,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:06,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:06,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:06,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,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-11-18 10:13:06,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:06,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:06,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:06,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:06,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-11-18 10:13:06,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:06,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:06,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:06,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:06,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:06,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,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-11-18 10:13:07,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:07,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:07,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,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-11-18 10:13:07,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:07,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:07,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:07,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:07,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:07,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:07,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:07,017 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:13:07,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,018 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:13:07,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:07,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:07,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:07,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:07,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,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-11-18 10:13:07,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:07,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:07,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:07,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,037 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:13:07,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,039 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:13:07,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:07,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:07,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:07,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:07,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,053 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:13:07,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,055 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:13:07,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:07,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:07,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:07,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:07,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:07,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:07,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:07,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:07,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:07,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:07,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:07,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:07,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:07,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:07,100 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:13:07,111 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:13:07,111 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:13:07,112 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:13:07,113 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:13:07,114 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:13:07,114 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 Supporting invariants [] [2018-11-18 10:13:07,158 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-18 10:13:07,163 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:13:07,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:07,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:07,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:13:07,232 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:13:07,233 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 10:13:07,281 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 4 states. [2018-11-18 10:13:07,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 10:13:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 10:13:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-18 10:13:07,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 9 letters. [2018-11-18 10:13:07,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:07,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 14 letters. Loop has 9 letters. [2018-11-18 10:13:07,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:07,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-18 10:13:07,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:07,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-18 10:13:07,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:13:07,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 27 transitions. [2018-11-18 10:13:07,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 10:13:07,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 10:13:07,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-18 10:13:07,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:13:07,287 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 10:13:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-18 10:13:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 10:13:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 10:13:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-18 10:13:07,289 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 10:13:07,289 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-18 10:13:07,289 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:13:07,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-18 10:13:07,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:13:07,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:13:07,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:13:07,290 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:13:07,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:13:07,290 INFO L794 eck$LassoCheckResult]: Stem: 203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 186#L558 assume !(main_~length1~0 < 1); 187#L558-2 assume !(main_~length2~0 < 1); 194#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 204#L545-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 195#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 196#L548-6 [2018-11-18 10:13:07,290 INFO L796 eck$LassoCheckResult]: Loop: 196#L548-6 assume true; 188#L548-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 189#L548-2 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 192#L548-4 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 196#L548-6 [2018-11-18 10:13:07,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-11-18 10:13:07,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:07,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:07,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:07,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:13:07,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:07,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:07,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 1 times [2018-11-18 10:13:07,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:07,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:07,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:07,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:13:07,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:07,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2145109973, now seen corresponding path program 1 times [2018-11-18 10:13:07,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:07,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:07,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:13:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:07,650 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-18 10:13:07,712 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:13:07,712 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:13:07,712 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:13:07,712 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:13:07,712 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:13:07,712 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:13:07,713 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:13:07,713 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:13:07,713 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-18 10:13:07,713 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:13:07,713 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:13:07,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:07,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:08,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:13:08,297 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:13:08,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,314 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:08,314 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:08,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:08,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:08,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:08,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:08,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:08,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:08,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:08,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,342 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:13:08,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,343 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:13:08,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:08,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:08,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:08,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:08,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:08,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:08,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:08,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:08,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:08,363 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:13:08,375 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:13:08,375 INFO L444 ModelExtractionUtils]: 37 out of 43 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 10:13:08,376 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:13:08,377 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:13:08,377 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:13:08,377 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2018-11-18 10:13:08,432 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-18 10:13:08,434 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:13:08,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:08,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:08,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:13:08,487 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 10:13:08,488 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-18 10:13:08,533 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 49 states and 63 transitions. Complement of second has 8 states. [2018-11-18 10:13:08,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:13:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:13:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-18 10:13:08,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 10:13:08,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:08,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-18 10:13:08,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:08,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-18 10:13:08,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:08,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 63 transitions. [2018-11-18 10:13:08,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:13:08,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 34 states and 44 transitions. [2018-11-18 10:13:08,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 10:13:08,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 10:13:08,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2018-11-18 10:13:08,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:13:08,539 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2018-11-18 10:13:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2018-11-18 10:13:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-18 10:13:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 10:13:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-18 10:13:08,541 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 10:13:08,542 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-18 10:13:08,542 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:13:08,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-18 10:13:08,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:13:08,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:13:08,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:13:08,543 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:13:08,543 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:13:08,543 INFO L794 eck$LassoCheckResult]: Stem: 390#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 372#L558 assume !(main_~length1~0 < 1); 373#L558-2 assume !(main_~length2~0 < 1); 380#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 393#L545-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 394#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 382#L548-6 assume true; 397#L548-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 396#L548-2 assume !cstrpbrk_#t~short7; 395#L548-4 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 391#L548-7 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 392#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 388#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 389#L545-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 383#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 381#L548-6 [2018-11-18 10:13:08,543 INFO L796 eck$LassoCheckResult]: Loop: 381#L548-6 assume true; 374#L548-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 375#L548-2 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 378#L548-4 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 381#L548-6 [2018-11-18 10:13:08,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:08,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1714078621, now seen corresponding path program 1 times [2018-11-18 10:13:08,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:08,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:08,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:13:08,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:13:08,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:13:08,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 10:13:08,595 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 10:13:08,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 2 times [2018-11-18 10:13:08,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:08,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:13:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 10:13:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 10:13:08,723 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 10:13:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:13:08,808 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2018-11-18 10:13:08,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 10:13:08,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. [2018-11-18 10:13:08,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 10:13:08,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 39 transitions. [2018-11-18 10:13:08,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-18 10:13:08,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 10:13:08,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 39 transitions. [2018-11-18 10:13:08,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:13:08,813 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-18 10:13:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 39 transitions. [2018-11-18 10:13:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 10:13:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 10:13:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-18 10:13:08,816 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 10:13:08,816 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-18 10:13:08,816 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:13:08,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2018-11-18 10:13:08,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 10:13:08,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:13:08,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:13:08,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:13:08,817 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 10:13:08,817 INFO L794 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 465#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 452#L558 assume !(main_~length1~0 < 1); 453#L558-2 assume !(main_~length2~0 < 1); 460#L561-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);assume { :begin_inline_cstrpbrk } true;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 471#L545-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 464#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 462#L548-6 assume true; 477#L548-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 476#L548-2 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 475#L548-4 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7; 473#L548-7 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 474#L550 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 468#L545-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 469#L545-4 assume true;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 463#L545-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 461#L548-6 [2018-11-18 10:13:08,818 INFO L796 eck$LassoCheckResult]: Loop: 461#L548-6 assume true; 454#L548-1 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 455#L548-2 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 458#L548-4 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 461#L548-6 [2018-11-18 10:13:08,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:08,818 INFO L82 PathProgramCache]: Analyzing trace with hash 805881313, now seen corresponding path program 2 times [2018-11-18 10:13:08,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:08,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:08,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:13:08,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:08,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:08,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1787563, now seen corresponding path program 3 times [2018-11-18 10:13:08,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:08,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:13:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:08,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:08,849 INFO L82 PathProgramCache]: Analyzing trace with hash -795992949, now seen corresponding path program 1 times [2018-11-18 10:13:08,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:13:08,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:13:08,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:13:08,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:13:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:13:09,406 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 130 [2018-11-18 10:13:09,962 WARN L180 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2018-11-18 10:13:09,964 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:13:09,964 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:13:09,964 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:13:09,964 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:13:09,964 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:13:09,964 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:13:09,964 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:13:09,964 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:13:09,964 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-18 10:13:09,964 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:13:09,964 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:13:09,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:09,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:10,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:10,124 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 10:13:10,536 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 95 [2018-11-18 10:13:10,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:13:11,002 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-18 10:13:11,213 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:13:11,213 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:13:11,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:11,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:11,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:13:11,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:13:11,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:13:11,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:11,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:11,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,256 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-18 10:13:11,256 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-18 10:13:11,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,279 INFO L402 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2018-11-18 10:13:11,279 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-18 10:13:11,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,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-11-18 10:13:11,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:11,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:11,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:11,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:11,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:13:11,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,386 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:13:11,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,387 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:13:11,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,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-11-18 10:13:11,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,392 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:13:11,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,393 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:13:11,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:13:11,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-11-18 10:13:11,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:13:11,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:13:11,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:13:11,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:13:11,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:13:11,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:13:11,416 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:13:11,428 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 10:13:11,428 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:13:11,428 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:13:11,429 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:13:11,429 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:13:11,429 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2018-11-18 10:13:11,578 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2018-11-18 10:13:11,578 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 10:13:11,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:11,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:11,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:13:11,621 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:13:11,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 10:13:11,640 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 47 states and 57 transitions. Complement of second has 7 states. [2018-11-18 10:13:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:13:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:13:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 10:13:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 10:13:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:11,641 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:13:11,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:11,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:11,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:13:11,688 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:13:11,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 10:13:11,702 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 47 states and 57 transitions. Complement of second has 7 states. [2018-11-18 10:13:11,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:13:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:13:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-18 10:13:11,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 10:13:11,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:11,703 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:13:11,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:13:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:11,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:13:11,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:13:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:13:11,731 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 10:13:11,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-18 10:13:11,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 49 states and 61 transitions. Complement of second has 6 states. [2018-11-18 10:13:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 10:13:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 10:13:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-18 10:13:11,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-18 10:13:11,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:11,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-18 10:13:11,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:11,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-18 10:13:11,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:13:11,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 61 transitions. [2018-11-18 10:13:11,754 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:13:11,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2018-11-18 10:13:11,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 10:13:11,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 10:13:11,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 10:13:11,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 10:13:11,754 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:13:11,754 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:13:11,754 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:13:11,754 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:13:11,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:13:11,755 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 10:13:11,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 10:13:11,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 10:13:11 BoogieIcfgContainer [2018-11-18 10:13:11,759 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 10:13:11,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:13:11,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:13:11,759 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:13:11,760 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:13:05" (3/4) ... [2018-11-18 10:13:11,762 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 10:13:11,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:13:11,763 INFO L168 Benchmark]: Toolchain (without parser) took 7001.38 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 82.8 MB. Max. memory is 11.5 GB. [2018-11-18 10:13:11,763 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:13:11,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:13:11,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:13:11,764 INFO L168 Benchmark]: Boogie Preprocessor took 16.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:13:11,764 INFO L168 Benchmark]: RCFGBuilder took 227.65 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 10:13:11,764 INFO L168 Benchmark]: BuchiAutomizer took 6411.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. [2018-11-18 10:13:11,765 INFO L168 Benchmark]: Witness Printer took 3.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:13:11,767 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 227.65 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6411.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.1 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.04 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 116 SDtfs, 118 SDslu, 68 SDs, 0 SdLazy, 97 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital366 mio100 ax100 hnf99 lsp92 ukn71 mio100 lsp31 div136 bol100 ite100 ukn100 eq161 hnf77 smp92 dnf701 smp23 tf100 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 119ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...