./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eec7850a55859668859d25c9503478e74955da1a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:33,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:33,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:33,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:33,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:33,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:33,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:33,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:33,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:33,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:33,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:33,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:33,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:33,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:33,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:33,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:33,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:33,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:33,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:33,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:33,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:33,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:33,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:33,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:33,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:33,265 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:33,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:33,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:33,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:33,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:33,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:33,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:33,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:33,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:33,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:33,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:33,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:33,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:33,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:33,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:33,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:33,276 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:33,297 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:33,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:33,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:33,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:33,303 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:33,303 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:33,303 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:33,303 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:33,303 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:33,303 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:33,303 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:33,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:33,304 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:33,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:33,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:33,304 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:33,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:33,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:33,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:33,304 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:33,304 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:33,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:33,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:33,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:33,305 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:33,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:33,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:33,305 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:33,306 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:33,306 INFO L138 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_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec7850a55859668859d25c9503478e74955da1a [2019-10-22 08:58:33,332 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:33,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:33,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:33,347 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:33,348 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:33,349 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c [2019-10-22 08:58:33,396 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/data/555efd13e/3e6a8fd588d84f368688d74b1ac81beb/FLAG29e01074b [2019-10-22 08:58:33,808 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:33,808 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/sv-benchmarks/c/termination-crafted-lit/cstrpbrk.c [2019-10-22 08:58:33,814 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/data/555efd13e/3e6a8fd588d84f368688d74b1ac81beb/FLAG29e01074b [2019-10-22 08:58:34,192 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/uautomizer/data/555efd13e/3e6a8fd588d84f368688d74b1ac81beb [2019-10-22 08:58:34,195 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:34,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:34,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:34,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:34,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:34,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7587b7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34, skipping insertion in model container [2019-10-22 08:58:34,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,212 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:34,226 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:34,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:34,388 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:34,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:34,496 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:34,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34 WrapperNode [2019-10-22 08:58:34,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:34,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:34,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:34,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:34,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:34,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:34,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:34,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:34,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... [2019-10-22 08:58:34,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:34,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:34,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:34,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:34,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f2fb534-d8da-4cae-a9d3-711b1f755656/bin/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 [2019-10-22 08:58:34,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:58:34,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:58:34,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:34,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:34,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:58:34,849 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:34,849 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-10-22 08:58:34,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:34 BoogieIcfgContainer [2019-10-22 08:58:34,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:34,851 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:34,851 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:34,855 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:34,855 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:34,856 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:34" (1/3) ... [2019-10-22 08:58:34,857 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3664de96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:34, skipping insertion in model container [2019-10-22 08:58:34,857 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:34,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:34" (2/3) ... [2019-10-22 08:58:34,857 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3664de96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:34, skipping insertion in model container [2019-10-22 08:58:34,857 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:34,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:34" (3/3) ... [2019-10-22 08:58:34,859 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk.c [2019-10-22 08:58:34,937 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:34,938 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:34,938 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:34,938 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:34,940 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:34,940 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:34,941 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:34,941 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:34,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 08:58:34,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:58:34,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:34,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:34,985 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:34,986 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:34,986 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:34,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2019-10-22 08:58:34,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:58:34,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:34,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:34,989 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:34,989 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 08:58:34,997 INFO L791 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13#L-1true havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 22#L14true assume !(build_nondet_String_~length~0 < 1); 18#L14-2true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 10#L19true main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 16#L14-3true assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 12#L14-5true call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 8#L19-1true main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 4#L31-4true [2019-10-22 08:58:34,998 INFO L793 eck$LassoCheckResult]: Loop: 4#L31-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 11#L31-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; 9#L34-5true assume !true; 5#L34-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 23#L36true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 6#L31-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; 4#L31-4true [2019-10-22 08:58:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:35,005 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 1 times [2019-10-22 08:58:35,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:35,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236473860] [2019-10-22 08:58:35,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:35,171 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:35,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1602834410, now seen corresponding path program 1 times [2019-10-22 08:58:35,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:35,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704347284] [2019-10-22 08:58:35,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:35,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704347284] [2019-10-22 08:58:35,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:35,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:35,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043295461] [2019-10-22 08:58:35,209 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 08:58:35,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:35,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:58:35,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:58:35,224 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-22 08:58:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:35,231 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2019-10-22 08:58:35,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:58:35,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. [2019-10-22 08:58:35,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:58:35,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 20 transitions. [2019-10-22 08:58:35,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 08:58:35,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:58:35,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-10-22 08:58:35,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:35,242 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 08:58:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-10-22 08:58:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 08:58:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:58:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-10-22 08:58:35,269 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 08:58:35,269 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 08:58:35,269 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:35,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-10-22 08:58:35,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 08:58:35,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:35,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:35,271 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:35,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:35,271 INFO L791 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 63#L14 assume !(build_nondet_String_~length~0 < 1); 65#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 58#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 59#L14-3 assume build_nondet_String_~length~0 < 1;build_nondet_String_~length~0 := 1; 60#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 55#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 50#L31-4 [2019-10-22 08:58:35,272 INFO L793 eck$LassoCheckResult]: Loop: 50#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 51#L31-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; 56#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 57#L34-1 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); 61#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 52#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 53#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 54#L31-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; 50#L31-4 [2019-10-22 08:58:35,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:35,272 INFO L82 PathProgramCache]: Analyzing trace with hash 176610378, now seen corresponding path program 2 times [2019-10-22 08:58:35,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:35,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366697971] [2019-10-22 08:58:35,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:35,320 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:35,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 1 times [2019-10-22 08:58:35,321 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:35,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648977521] [2019-10-22 08:58:35,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:35,348 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:35,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:35,349 INFO L82 PathProgramCache]: Analyzing trace with hash -955886854, now seen corresponding path program 1 times [2019-10-22 08:58:35,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:35,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41552520] [2019-10-22 08:58:35,349 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:35,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:35,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41552520] [2019-10-22 08:58:35,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:35,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:35,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843014384] [2019-10-22 08:58:35,785 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-22 08:58:36,039 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-22 08:58:36,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:36,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:36,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:36,041 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-10-22 08:58:36,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:36,283 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-22 08:58:36,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:36,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2019-10-22 08:58:36,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-10-22 08:58:36,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2019-10-22 08:58:36,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-10-22 08:58:36,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-10-22 08:58:36,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2019-10-22 08:58:36,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:36,288 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-22 08:58:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2019-10-22 08:58:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-10-22 08:58:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-22 08:58:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-22 08:58:36,295 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-22 08:58:36,295 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-22 08:58:36,295 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:36,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2019-10-22 08:58:36,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2019-10-22 08:58:36,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:36,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:36,299 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:36,299 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:36,300 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 130#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 131#L14 assume !(build_nondet_String_~length~0 < 1); 138#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 125#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 126#L14-3 assume !(build_nondet_String_~length~0 < 1); 135#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 122#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 117#L31-4 [2019-10-22 08:58:36,300 INFO L793 eck$LassoCheckResult]: Loop: 117#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 118#L31-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; 127#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 136#L34-1 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); 137#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 119#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 120#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 121#L31-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; 117#L31-4 [2019-10-22 08:58:36,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:36,300 INFO L82 PathProgramCache]: Analyzing trace with hash 176612300, now seen corresponding path program 1 times [2019-10-22 08:58:36,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:36,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163273702] [2019-10-22 08:58:36,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:36,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:36,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:36,362 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1952985167, now seen corresponding path program 2 times [2019-10-22 08:58:36,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:36,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744164038] [2019-10-22 08:58:36,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:36,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:36,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:36,409 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:36,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:36,410 INFO L82 PathProgramCache]: Analyzing trace with hash -254822276, now seen corresponding path program 1 times [2019-10-22 08:58:36,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:36,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886450042] [2019-10-22 08:58:36,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:36,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:36,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:36,490 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:36,642 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-22 08:58:36,869 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-10-22 08:58:37,220 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 107 [2019-10-22 08:58:37,336 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:37,336 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:37,336 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:37,337 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:37,337 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:37,337 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:37,337 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:37,337 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:37,337 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration3_Lasso [2019-10-22 08:58:37,337 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:37,338 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:37,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:37,686 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-10-22 08:58:37,826 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-10-22 08:58:37,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:38,368 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:58:38,530 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-10-22 08:58:38,544 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:38,549 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:38,550 INFO L120 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 [2019-10-22 08:58:38,552 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,552 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,552 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,553 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,553 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,554 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,554 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,557 INFO L120 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 [2019-10-22 08:58:38,557 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,558 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,558 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,559 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,559 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,560 INFO L120 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 [2019-10-22 08:58:38,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,561 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,561 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,561 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,562 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,562 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,563 INFO L120 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 [2019-10-22 08:58:38,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,564 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,565 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,565 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,566 INFO L120 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 [2019-10-22 08:58:38,566 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,567 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,567 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,567 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,569 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:38,569 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:38,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,572 INFO L120 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 [2019-10-22 08:58:38,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,572 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,573 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,573 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,573 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,574 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,574 INFO L120 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 [2019-10-22 08:58:38,575 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,575 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,575 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,575 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,576 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,576 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,577 INFO L120 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 [2019-10-22 08:58:38,577 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,577 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,578 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,578 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,579 INFO L120 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 [2019-10-22 08:58:38,580 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,580 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,580 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,580 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,580 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,581 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,581 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,581 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,582 INFO L120 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 [2019-10-22 08:58:38,582 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,583 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,583 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,583 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,584 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:38,585 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:38,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,587 INFO L120 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 [2019-10-22 08:58:38,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,588 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,588 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,589 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,589 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,590 INFO L120 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 [2019-10-22 08:58:38,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,590 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,591 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,591 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,593 INFO L120 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 [2019-10-22 08:58:38,593 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,593 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,593 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,593 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,594 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,596 INFO L120 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 [2019-10-22 08:58:38,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,597 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,597 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,597 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,598 INFO L120 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 [2019-10-22 08:58:38,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,599 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,599 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,599 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,599 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,599 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,600 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,600 INFO L120 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 [2019-10-22 08:58:38,601 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,601 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,601 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,602 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,602 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,603 INFO L120 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 [2019-10-22 08:58:38,604 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,604 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,604 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,604 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,605 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,605 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,606 INFO L120 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 [2019-10-22 08:58:38,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,607 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,607 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,607 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,611 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:38,611 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:38,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,623 INFO L120 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 [2019-10-22 08:58:38,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,625 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:38,625 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:38,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,627 INFO L120 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 [2019-10-22 08:58:38,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,628 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:58:38,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,635 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:58:38,635 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:38,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,672 INFO L120 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 [2019-10-22 08:58:38,673 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:38,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,674 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:38,674 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:38,676 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,677 INFO L120 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 [2019-10-22 08:58:38,677 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,678 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,678 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,678 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,679 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:38,679 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:38,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,684 INFO L120 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 [2019-10-22 08:58:38,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,685 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,685 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,685 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,687 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:38,687 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:38,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,695 INFO L120 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 [2019-10-22 08:58:38,695 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,695 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,696 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,696 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,697 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:38,697 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:38,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:38,700 INFO L120 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 [2019-10-22 08:58:38,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:38,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:38,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:38,701 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:38,704 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:38,704 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:38,724 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:38,765 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:58:38,766 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:58:38,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:38,769 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:38,769 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:38,770 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2019-10-22 08:58:38,795 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2019-10-22 08:58:38,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:38,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:38,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:38,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:38,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:38,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:38,886 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 [2019-10-22 08:58:38,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-10-22 08:58:38,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 42 states and 50 transitions. Complement of second has 4 states. [2019-10-22 08:58:38,937 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 [2019-10-22 08:58:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:38,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-10-22 08:58:38,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 8 letters. [2019-10-22 08:58:38,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:38,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 16 letters. Loop has 8 letters. [2019-10-22 08:58:38,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:38,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 16 letters. [2019-10-22 08:58:38,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:38,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2019-10-22 08:58:38,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:38,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 21 states and 27 transitions. [2019-10-22 08:58:38,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-10-22 08:58:38,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 08:58:38,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-10-22 08:58:38,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:38,952 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-22 08:58:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-10-22 08:58:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-22 08:58:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 08:58:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-10-22 08:58:38,953 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-22 08:58:38,953 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-10-22 08:58:38,953 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:38,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2019-10-22 08:58:38,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:38,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:38,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:38,955 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:38,955 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:38,955 INFO L791 eck$LassoCheckResult]: Stem: 300#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 298#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 299#L14 assume !(build_nondet_String_~length~0 < 1); 301#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 293#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 294#L14-3 assume !(build_nondet_String_~length~0 < 1); 295#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 288#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 281#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 283#L31-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; 289#L34-5 [2019-10-22 08:58:38,955 INFO L793 eck$LassoCheckResult]: Loop: 289#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 290#L34-1 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); 296#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;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; 289#L34-5 [2019-10-22 08:58:38,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2074270767, now seen corresponding path program 1 times [2019-10-22 08:58:38,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:38,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090748931] [2019-10-22 08:58:38,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:38,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:38,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:38,990 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 1 times [2019-10-22 08:58:38,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:38,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188983172] [2019-10-22 08:58:38,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:38,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:38,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,006 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:39,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1389069017, now seen corresponding path program 1 times [2019-10-22 08:58:39,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:39,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895238475] [2019-10-22 08:58:39,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:39,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:39,038 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:39,224 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-10-22 08:58:39,597 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 119 [2019-10-22 08:58:39,724 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-22 08:58:39,725 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:39,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:39,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:39,725 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:39,725 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:39,725 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:39,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:39,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:39,726 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration4_Lasso [2019-10-22 08:58:39,726 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:39,726 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:39,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:39,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:39,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:39,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:39,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:39,947 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-10-22 08:58:40,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:40,566 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-10-22 08:58:40,714 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-22 08:58:40,730 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:40,730 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:40,730 INFO L120 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 [2019-10-22 08:58:40,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:40,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:40,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:40,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:40,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:40,732 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:40,732 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:40,733 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:40,733 INFO L120 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 [2019-10-22 08:58:40,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:40,734 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:40,734 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:40,734 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:40,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:40,735 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:40,735 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:40,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:40,736 INFO L120 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 [2019-10-22 08:58:40,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:40,737 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:40,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:40,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:40,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:40,740 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:40,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:40,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:40,741 INFO L120 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 [2019-10-22 08:58:40,742 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:40,742 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:40,742 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:40,742 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:40,742 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:40,742 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:40,742 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:40,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:40,743 INFO L120 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 [2019-10-22 08:58:40,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:40,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:40,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:40,744 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:40,748 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:40,748 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:40,790 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:40,819 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:58:40,826 INFO L444 ModelExtractionUtils]: 41 out of 46 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:58:40,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:40,828 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:40,829 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:40,829 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2019-10-22 08:58:40,859 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:58:40,861 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:40,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:40,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:40,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:40,920 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 [2019-10-22 08:58:40,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-10-22 08:58:40,955 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 27 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 46 states and 59 transitions. Complement of second has 5 states. [2019-10-22 08:58:40,958 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 [2019-10-22 08:58:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-10-22 08:58:40,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:58:40,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:40,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 08:58:40,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:40,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:58:40,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:40,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 59 transitions. [2019-10-22 08:58:40,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:40,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 33 states and 42 transitions. [2019-10-22 08:58:40,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:58:40,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:58:40,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2019-10-22 08:58:40,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:40,962 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-10-22 08:58:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2019-10-22 08:58:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-10-22 08:58:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:58:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-22 08:58:40,967 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 08:58:40,967 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-22 08:58:40,967 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:58:40,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-10-22 08:58:40,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:40,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:40,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:40,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:40,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:40,969 INFO L791 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 461#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 462#L14 assume !(build_nondet_String_~length~0 < 1); 467#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 457#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 458#L14-3 assume !(build_nondet_String_~length~0 < 1); 460#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 452#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 444#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 445#L31-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; 459#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 466#L34-1 assume !cstrpbrk_#t~short7; 464#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 449#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 450#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 451#L31-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; 446#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 448#L31-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; 453#L34-5 [2019-10-22 08:58:40,969 INFO L793 eck$LassoCheckResult]: Loop: 453#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 454#L34-1 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); 463#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;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; 453#L34-5 [2019-10-22 08:58:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1703936771, now seen corresponding path program 1 times [2019-10-22 08:58:40,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:40,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381738959] [2019-10-22 08:58:40,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:40,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:41,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381738959] [2019-10-22 08:58:41,037 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:41,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:41,038 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870370961] [2019-10-22 08:58:41,038 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 2 times [2019-10-22 08:58:41,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384805384] [2019-10-22 08:58:41,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,059 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:41,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:41,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:41,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:41,194 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2019-10-22 08:58:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:41,263 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-10-22 08:58:41,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:58:41,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 41 transitions. [2019-10-22 08:58:41,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 08:58:41,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 30 states and 37 transitions. [2019-10-22 08:58:41,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 08:58:41,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 08:58:41,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-10-22 08:58:41,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:41,267 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-10-22 08:58:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-10-22 08:58:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-10-22 08:58:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 08:58:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-10-22 08:58:41,269 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 08:58:41,269 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 08:58:41,269 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:58:41,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-10-22 08:58:41,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:41,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:41,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:41,271 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:41,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:41,271 INFO L791 eck$LassoCheckResult]: Stem: 543#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 541#L-1 havoc main_#res;havoc main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.offset, main_#t~ret12.base, main_#t~ret12.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 542#L14 assume !(build_nondet_String_~length~0 < 1); 544#L14-2 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 536#L19 main_#t~ret10.base, main_#t~ret10.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#res.base, build_nondet_String_#res.offset;havoc build_nondet_String_#t~nondet0, build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset, build_nondet_String_~length~0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset;build_nondet_String_~length~0 := build_nondet_String_#t~nondet0;havoc build_nondet_String_#t~nondet0; 537#L14-3 assume !(build_nondet_String_~length~0 < 1); 538#L14-5 call build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0);build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset := build_nondet_String_#t~malloc1.base, build_nondet_String_#t~malloc1.offset;call write~int(0, build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset + (build_nondet_String_~length~0 - 1), 1);build_nondet_String_#res.base, build_nondet_String_#res.offset := build_nondet_String_~nondetString~0.base, build_nondet_String_~nondetString~0.offset; 530#L19-1 main_#t~ret11.base, main_#t~ret11.offset := build_nondet_String_#res.base, build_nondet_String_#res.offset;cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_#t~ret10.base, main_#t~ret10.offset, main_#t~ret11.base, main_#t~ret11.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; 522#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 523#L31-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; 533#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 534#L34-1 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); 545#L34-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 527#L34-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 528#L36 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 529#L31-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; 524#L31-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 525#L31-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; 531#L34-5 [2019-10-22 08:58:41,271 INFO L793 eck$LassoCheckResult]: Loop: 531#L34-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 532#L34-1 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); 539#L34-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;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; 531#L34-5 [2019-10-22 08:58:41,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash -71070591, now seen corresponding path program 2 times [2019-10-22 08:58:41,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274907383] [2019-10-22 08:58:41,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,298 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:41,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash 63657, now seen corresponding path program 3 times [2019-10-22 08:58:41,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216067389] [2019-10-22 08:58:41,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,306 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:41,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:41,307 INFO L82 PathProgramCache]: Analyzing trace with hash 154934313, now seen corresponding path program 1 times [2019-10-22 08:58:41,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:41,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428429995] [2019-10-22 08:58:41,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:41,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:41,337 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:42,200 WARN L191 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 156 [2019-10-22 08:58:42,875 WARN L191 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 111 [2019-10-22 08:58:42,877 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:42,877 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:42,877 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:42,877 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:42,877 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:42,877 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:42,877 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:42,877 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:42,877 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk.c_Iteration6_Lasso [2019-10-22 08:58:42,877 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:42,878 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:42,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:42,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:43,039 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 08:58:43,562 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2019-10-22 08:58:43,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:43,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:43,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:43,941 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-10-22 08:58:43,986 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-10-22 08:58:46,557 WARN L191 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 143 DAG size of output: 90 [2019-10-22 08:58:46,827 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-10-22 08:58:46,846 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:46,847 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:46,847 INFO L120 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 [2019-10-22 08:58:46,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,848 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,848 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,848 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,850 INFO L120 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 [2019-10-22 08:58:46,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,850 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,852 INFO L120 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 [2019-10-22 08:58:46,852 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,852 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,853 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,853 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,854 INFO L120 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 [2019-10-22 08:58:46,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,854 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,855 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,855 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,855 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,856 INFO L120 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 [2019-10-22 08:58:46,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,857 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,857 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:46,857 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:46,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,859 INFO L120 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 [2019-10-22 08:58:46,859 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,859 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,860 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,860 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,860 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,861 INFO L120 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 [2019-10-22 08:58:46,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,861 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,861 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,861 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,861 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,862 INFO L120 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 [2019-10-22 08:58:46,863 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,863 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,864 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,864 INFO L120 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 [2019-10-22 08:58:46,865 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,865 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,865 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,866 INFO L120 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 [2019-10-22 08:58:46,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,867 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,868 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:46,868 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:46,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,869 INFO L120 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 [2019-10-22 08:58:46,869 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,869 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,869 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,870 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,870 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,870 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,871 INFO L120 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 [2019-10-22 08:58:46,871 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,871 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,872 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,872 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,873 INFO L120 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 [2019-10-22 08:58:46,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,873 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,874 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,875 INFO L120 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 [2019-10-22 08:58:46,875 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,876 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,876 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,877 INFO L120 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 [2019-10-22 08:58:46,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:46,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,877 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:46,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:46,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,879 INFO L120 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 [2019-10-22 08:58:46,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,879 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,880 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:46,880 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:46,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:46,882 INFO L120 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 [2019-10-22 08:58:46,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:46,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:46,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:46,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:46,885 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:46,885 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:46,897 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:46,907 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:46,907 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:46,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:46,908 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:58:46,909 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:46,909 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0.base)_3 Supporting invariants [] [2019-10-22 08:58:46,980 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-10-22 08:58:46,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:58:46,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:47,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:47,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:47,032 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 [2019-10-22 08:58:47,032 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:58:47,054 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 44 states and 53 transitions. Complement of second has 5 states. [2019-10-22 08:58:47,054 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 [2019-10-22 08:58:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-10-22 08:58:47,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:58:47,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:47,055 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:47,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:47,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:47,091 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 [2019-10-22 08:58:47,091 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:58:47,103 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 44 states and 53 transitions. Complement of second has 5 states. [2019-10-22 08:58:47,105 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 [2019-10-22 08:58:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-10-22 08:58:47,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:58:47,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:47,106 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:47,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:47,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:58:47,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:47,158 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 08:58:47,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:58:47,173 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 44 states and 55 transitions. Complement of second has 4 states. [2019-10-22 08:58:47,174 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 [2019-10-22 08:58:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2019-10-22 08:58:47,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:58:47,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:47,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 21 letters. Loop has 3 letters. [2019-10-22 08:58:47,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:47,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 18 letters. Loop has 6 letters. [2019-10-22 08:58:47,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:47,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2019-10-22 08:58:47,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:47,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2019-10-22 08:58:47,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:47,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:47,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:47,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:47,178 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:47,178 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:47,178 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:47,178 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:58:47,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:47,179 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:47,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:47,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:47 BoogieIcfgContainer [2019-10-22 08:58:47,186 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:47,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:47,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:47,186 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:47,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:34" (3/4) ... [2019-10-22 08:58:47,189 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:47,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:47,190 INFO L168 Benchmark]: Toolchain (without parser) took 12993.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 456.7 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -237.9 MB). Peak memory consumption was 218.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,190 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:47,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -234.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:47,192 INFO L168 Benchmark]: Boogie Preprocessor took 24.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,192 INFO L168 Benchmark]: RCFGBuilder took 292.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,192 INFO L168 Benchmark]: BuchiAutomizer took 12334.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 272.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.3 MB). Peak memory consumption was 238.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:47,193 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:47,195 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.0 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -234.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 292.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12334.75 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 272.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -34.3 MB). Peak memory consumption was 238.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[sc1] + -1 * sc1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 11.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 145 SDtfs, 153 SDslu, 111 SDs, 0 SdLazy, 168 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital374 mio100 ax100 hnf99 lsp92 ukn69 mio100 lsp47 div119 bol100 ite100 ukn100 eq173 hnf86 smp83 dnf1593 smp45 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 44ms VariablesStem: 11 VariablesLoop: 5 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...