./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c10d45b5c95e322c3a9476f6a89ce233987fcc3d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 06:22:15,206 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:22:15,208 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:22:15,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:22:15,218 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:22:15,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:22:15,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:22:15,221 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:22:15,222 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:22:15,223 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:22:15,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:22:15,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:22:15,224 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:22:15,225 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:22:15,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:22:15,226 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:22:15,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:22:15,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:22:15,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:22:15,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:22:15,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:22:15,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:22:15,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:22:15,234 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:22:15,234 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:22:15,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:22:15,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:22:15,236 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:22:15,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:22:15,237 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:22:15,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:22:15,238 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:22:15,238 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:22:15,238 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:22:15,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:22:15,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:22:15,240 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 06:22:15,252 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:22:15,252 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:22:15,253 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:22:15,253 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:22:15,253 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:22:15,253 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 06:22:15,253 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 06:22:15,254 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 06:22:15,254 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 06:22:15,254 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 06:22:15,254 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 06:22:15,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:22:15,254 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:22:15,254 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:22:15,255 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:22:15,255 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 06:22:15,255 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 06:22:15,255 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 06:22:15,255 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:22:15,255 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 06:22:15,255 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:22:15,256 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 06:22:15,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:22:15,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:22:15,256 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 06:22:15,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:22:15,256 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:22:15,256 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 06:22:15,257 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 06:22:15,257 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10d45b5c95e322c3a9476f6a89ce233987fcc3d [2018-11-23 06:22:15,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:22:15,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:22:15,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:22:15,295 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:22:15,295 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:22:15,295 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-23 06:22:15,335 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/data/48183bc08/10fa9ccd8d2e4b02ad1d00a9e2570713/FLAGf078196d0 [2018-11-23 06:22:15,724 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:22:15,725 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-23 06:22:15,735 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/data/48183bc08/10fa9ccd8d2e4b02ad1d00a9e2570713/FLAGf078196d0 [2018-11-23 06:22:16,106 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/data/48183bc08/10fa9ccd8d2e4b02ad1d00a9e2570713 [2018-11-23 06:22:16,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:22:16,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:22:16,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:22:16,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:22:16,113 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:22:16,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92c2917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16, skipping insertion in model container [2018-11-23 06:22:16,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:22:16,151 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:22:16,347 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:22:16,355 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:22:16,385 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:22:16,464 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:22:16,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16 WrapperNode [2018-11-23 06:22:16,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:22:16,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:22:16,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:22:16,465 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:22:16,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:22:16,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:22:16,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:22:16,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:22:16,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... [2018-11-23 06:22:16,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:22:16,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:22:16,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:22:16,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:22:16,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:22:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:22:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:22:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:22:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:22:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:22:16,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:22:16,703 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:22:16,704 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 06:22:16,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:22:16 BoogieIcfgContainer [2018-11-23 06:22:16,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:22:16,704 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 06:22:16,704 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 06:22:16,707 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 06:22:16,707 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:22:16,707 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 06:22:16" (1/3) ... [2018-11-23 06:22:16,708 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@141071a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:22:16, skipping insertion in model container [2018-11-23 06:22:16,708 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:22:16,708 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:22:16" (2/3) ... [2018-11-23 06:22:16,709 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@141071a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 06:22:16, skipping insertion in model container [2018-11-23 06:22:16,709 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 06:22:16,709 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:22:16" (3/3) ... [2018-11-23 06:22:16,710 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrpbrk-alloca_true-termination.c.i [2018-11-23 06:22:16,749 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:22:16,749 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 06:22:16,750 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 06:22:16,750 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 06:22:16,750 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:22:16,750 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:22:16,750 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 06:22:16,750 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:22:16,750 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 06:22:16,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 06:22:16,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:22:16,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:16,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:16,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:22:16,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:22:16,784 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 06:22:16,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-23 06:22:16,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:22:16,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:16,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:16,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:22:16,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:22:16,794 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L562true assume !(main_~length1~0 < 1); 14#L562-2true assume !(main_~length2~0 < 1); 6#L565-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 16#L553-4true [2018-11-23 06:22:16,794 INFO L796 eck$LassoCheckResult]: Loop: 16#L553-4true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 11#L552-1true assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 13#L553-3true assume !true; 16#L553-4true [2018-11-23 06:22:16,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:16,799 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-11-23 06:22:16,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:16,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:16,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:16,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:16,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash 49828, now seen corresponding path program 1 times [2018-11-23 06:22:16,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:16,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:16,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:16,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:22:16,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-23 06:22:16,937 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 06:22:16,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 06:22:16,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 06:22:16,948 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-23 06:22:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:22:16,953 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-23 06:22:16,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 06:22:16,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-23 06:22:16,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:22:16,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2018-11-23 06:22:16,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 06:22:16,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 06:22:16,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-23 06:22:16,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:22:16,960 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 06:22:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-23 06:22:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-23 06:22:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 06:22:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-23 06:22:16,979 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 06:22:16,979 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-23 06:22:16,979 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 06:22:16,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-23 06:22:16,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-23 06:22:16,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:16,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:16,981 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 06:22:16,981 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 06:22:16,981 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 39#L562 assume !(main_~length1~0 < 1); 45#L562-2 assume !(main_~length2~0 < 1); 40#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 41#L553-4 [2018-11-23 06:22:16,981 INFO L796 eck$LassoCheckResult]: Loop: 41#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 46#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 47#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 43#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 41#L553-4 [2018-11-23 06:22:16,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-11-23 06:22:16,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:16,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:16,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:16,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:17,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1544297, now seen corresponding path program 1 times [2018-11-23 06:22:17,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:17,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:17,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:17,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:17,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:17,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:17,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1298350894, now seen corresponding path program 1 times [2018-11-23 06:22:17,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:17,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:17,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:17,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:17,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:17,371 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-11-23 06:22:17,461 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:22:17,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:22:17,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:22:17,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:22:17,463 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:22:17,463 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:22:17,463 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:22:17,463 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:22:17,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-23 06:22:17,463 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:22:17,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:22:17,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:17,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:18,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:22:18,114 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:22:18,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:18,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:18,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:18,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:18,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:18,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:18,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:18,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:18,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:18,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:18,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:18,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:18,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:18,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:18,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:18,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:18,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:18,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:18,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,156 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:22:18,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,159 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:22:18,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:18,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:18,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:18,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:18,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:18,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:18,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:18,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,181 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:22:18,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,184 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:22:18,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:18,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:18,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:18,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:18,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:18,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:18,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:18,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:18,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:18,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:18,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:18,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:18,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:18,232 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:22:18,253 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:22:18,254 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:22:18,256 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:22:18,257 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:22:18,257 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:22:18,257 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrpbrk_~s1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrpbrk_~s1.offset Supporting invariants [] [2018-11-23 06:22:18,285 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-23 06:22:18,292 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:22:18,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:18,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:18,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:18,365 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:22:18,366 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-23 06:22:18,405 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2018-11-23 06:22:18,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:22:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:22:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 06:22:18,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 06:22:18,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:18,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 06:22:18,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:18,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 06:22:18,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:18,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-23 06:22:18,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:22:18,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 15 states and 19 transitions. [2018-11-23 06:22:18,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 06:22:18,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 06:22:18,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2018-11-23 06:22:18,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:22:18,411 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 06:22:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2018-11-23 06:22:18,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 06:22:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 06:22:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-11-23 06:22:18,413 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 06:22:18,413 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2018-11-23 06:22:18,413 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 06:22:18,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2018-11-23 06:22:18,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:22:18,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:18,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:18,414 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:22:18,414 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:22:18,414 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 152#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 153#L562 assume !(main_~length1~0 < 1); 162#L562-2 assume !(main_~length2~0 < 1); 154#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 155#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 163#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 165#L553-3 [2018-11-23 06:22:18,414 INFO L796 eck$LassoCheckResult]: Loop: 165#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 157#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 158#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 165#L553-3 [2018-11-23 06:22:18,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935627, now seen corresponding path program 1 times [2018-11-23 06:22:18,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:18,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:18,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:18,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:18,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 1 times [2018-11-23 06:22:18,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:18,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:18,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:18,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:18,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:18,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:18,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1594172151, now seen corresponding path program 1 times [2018-11-23 06:22:18,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:18,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:18,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:18,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:18,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:18,726 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-23 06:22:18,804 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:22:18,804 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:22:18,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:22:18,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:22:18,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:22:18,805 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:22:18,805 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:22:18,805 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:22:18,805 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 06:22:18,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:22:18,805 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:22:18,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:18,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:18,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:18,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:18,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:18,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:18,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:19,328 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:22:19,328 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:22:19,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:19,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:19,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:19,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:19,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:19,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:19,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:19,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,336 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:19,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:19,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:19,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:19,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:19,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,340 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:19,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:19,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:19,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:19,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,344 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:22:19,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,346 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:22:19,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:19,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:19,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:19,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:19,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:19,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:19,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:19,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:19,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:19,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:19,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:19,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:19,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:19,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:19,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:19,398 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:22:19,411 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:22:19,411 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:22:19,412 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:22:19,413 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:22:19,413 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:22:19,413 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-11-23 06:22:19,452 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-23 06:22:19,454 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:22:19,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:19,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:19,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:19,517 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-23 06:22:19,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-23 06:22:19,563 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 31 states and 38 transitions. Complement of second has 6 states. [2018-11-23 06:22:19,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:22:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 06:22:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 06:22:19,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-23 06:22:19,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:19,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-23 06:22:19,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:19,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-23 06:22:19,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:19,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2018-11-23 06:22:19,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:22:19,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2018-11-23 06:22:19,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 06:22:19,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 06:22:19,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2018-11-23 06:22:19,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:22:19,569 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2018-11-23 06:22:19,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2018-11-23 06:22:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-11-23 06:22:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 06:22:19,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-11-23 06:22:19,571 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 06:22:19,571 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2018-11-23 06:22:19,571 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 06:22:19,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2018-11-23 06:22:19,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:22:19,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:19,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:19,572 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:22:19,572 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:22:19,572 INFO L794 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 308#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 309#L562 assume !(main_~length1~0 < 1); 318#L562-2 assume !(main_~length2~0 < 1); 310#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 311#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 319#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 320#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 315#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 316#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 322#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 321#L553-3 [2018-11-23 06:22:19,572 INFO L796 eck$LassoCheckResult]: Loop: 321#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 313#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 314#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 321#L553-3 [2018-11-23 06:22:19,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2120273357, now seen corresponding path program 2 times [2018-11-23 06:22:19,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:19,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:19,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:19,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:19,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:19,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 2 times [2018-11-23 06:22:19,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:19,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:19,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:19,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:19,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:19,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1020472847, now seen corresponding path program 1 times [2018-11-23 06:22:19,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:19,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:19,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:19,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:19,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 06:22:19,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61a89949-2371-4a1d-9a7f-102358dfa116/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 06:22:19,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:19,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:19,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-11-23 06:22:19,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 06:22:19,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:22:19,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 37 [2018-11-23 06:22:19,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-23 06:22:19,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 06:22:19,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:22:19,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:22:19,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-23 06:22:19,775 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2018-11-23 06:22:25,950 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 06:22:29,861 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 06:22:29,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-23 06:22:29,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-11-23 06:22:29,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 06:22:29,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:22:29,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 06:22:29,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-23 06:22:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 06:22:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-11-23 06:22:29,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 06:22:29,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=101, Unknown=3, NotChecked=0, Total=132 [2018-11-23 06:22:29,916 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 12 states. [2018-11-23 06:22:32,599 WARN L180 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-23 06:22:35,792 WARN L180 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-11-23 06:22:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:22:35,837 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 06:22:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 06:22:35,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-23 06:22:35,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:22:35,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-11-23 06:22:35,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 06:22:35,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 06:22:35,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-23 06:22:35,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 06:22:35,839 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 06:22:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-23 06:22:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-11-23 06:22:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 06:22:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-23 06:22:35,840 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 06:22:35,840 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-23 06:22:35,840 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 06:22:35,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-23 06:22:35,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 06:22:35,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 06:22:35,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 06:22:35,841 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:22:35,841 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 06:22:35,841 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10.base, main_#t~ret10.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 420#L562 assume !(main_~length1~0 < 1); 428#L562-2 assume !(main_~length2~0 < 1); 421#L565-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset, cstrpbrk_~c~0, cstrpbrk_~sc~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_~scanp~0.base, cstrpbrk_~scanp~0.offset;havoc cstrpbrk_~c~0;havoc cstrpbrk_~sc~0; 422#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 429#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 430#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 426#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 427#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 434#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 435#L553-1 assume !(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 432#L553-4 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;call cstrpbrk_#t~mem3 := read~int(cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem3; 433#L552-1 assume !!(0 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem3;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset; 431#L553-3 [2018-11-23 06:22:35,841 INFO L796 eck$LassoCheckResult]: Loop: 431#L553-3 cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset := cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset;cstrpbrk_~scanp~0.base, cstrpbrk_~scanp~0.offset := cstrpbrk_#t~post4.base, 1 + cstrpbrk_#t~post4.offset;call cstrpbrk_#t~mem5 := read~int(cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset, 1);cstrpbrk_~sc~0 := cstrpbrk_#t~mem5; 424#L553-1 assume !!(0 != cstrpbrk_~sc~0);havoc cstrpbrk_#t~post4.base, cstrpbrk_#t~post4.offset;havoc cstrpbrk_#t~mem5; 425#L554 assume !(cstrpbrk_~sc~0 == cstrpbrk_~c~0); 431#L553-3 [2018-11-23 06:22:35,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1095399647, now seen corresponding path program 2 times [2018-11-23 06:22:35,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:35,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:35,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:35,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:22:35,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:35,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash 58753, now seen corresponding path program 3 times [2018-11-23 06:22:35,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:35,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:35,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:35,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:35,868 INFO L82 PathProgramCache]: Analyzing trace with hash -110602269, now seen corresponding path program 3 times [2018-11-23 06:22:35,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:22:35,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:22:35,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:35,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 06:22:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:22:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:22:36,388 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 156 [2018-11-23 06:22:36,482 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 06:22:36,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 06:22:36,482 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 06:22:36,482 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 06:22:36,482 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 06:22:36,482 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 06:22:36,482 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 06:22:36,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 06:22:36,483 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrpbrk-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 06:22:36,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 06:22:36,483 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 06:22:36,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,821 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-11-23 06:22:36,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:36,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 06:22:37,471 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-23 06:22:37,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 06:22:37,524 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 06:22:37,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:37,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:37,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:37,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:37,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:37,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 06:22:37,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 06:22:37,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 06:22:37,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,560 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 06:22:37,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,561 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 06:22:37,561 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:37,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:37,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:37,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 06:22:37,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 06:22:37,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 06:22:37,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 06:22:37,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 06:22:37,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 06:22:37,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 06:22:37,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 06:22:37,610 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 06:22:37,631 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 06:22:37,631 INFO L444 ModelExtractionUtils]: 47 out of 52 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 06:22:37,632 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 06:22:37,633 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 06:22:37,633 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 06:22:37,633 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1, ULTIMATE.start_cstrpbrk_~scanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s2.base)_1 - 1*ULTIMATE.start_cstrpbrk_~scanp~0.offset Supporting invariants [] [2018-11-23 06:22:37,760 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-11-23 06:22:37,762 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 06:22:37,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:37,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:37,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:37,820 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:22:37,821 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 06:22:37,846 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 5 states. [2018-11-23 06:22:37,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:22:37,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:22:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-23 06:22:37,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 06:22:37,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:37,847 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:22:37,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:37,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:37,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:37,902 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:22:37,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 06:22:37,924 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2018-11-23 06:22:37,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:22:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:22:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-23 06:22:37,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 06:22:37,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:37,925 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 06:22:37,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:22:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:37,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:22:37,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 06:22:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 06:22:37,966 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 06:22:37,966 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 06:22:37,982 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 24 states and 29 transitions. Complement of second has 4 states. [2018-11-23 06:22:37,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 06:22:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 06:22:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-23 06:22:37,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 06:22:37,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:37,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 06:22:37,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:37,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 06:22:37,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 06:22:37,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2018-11-23 06:22:37,985 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:22:37,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2018-11-23 06:22:37,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 06:22:37,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 06:22:37,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 06:22:37,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 06:22:37,986 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:22:37,986 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:22:37,986 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 06:22:37,986 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 06:22:37,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 06:22:37,986 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 06:22:37,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 06:22:37,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 06:22:37 BoogieIcfgContainer [2018-11-23 06:22:37,992 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 06:22:37,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:22:37,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:22:37,992 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:22:37,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:22:16" (3/4) ... [2018-11-23 06:22:37,995 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 06:22:37,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:22:37,996 INFO L168 Benchmark]: Toolchain (without parser) took 21886.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -93.9 MB). Peak memory consumption was 139.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:37,997 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:22:37,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -207.4 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:37,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.32 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:37,998 INFO L168 Benchmark]: Boogie Preprocessor took 15.57 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. [2018-11-23 06:22:37,998 INFO L168 Benchmark]: RCFGBuilder took 194.96 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:37,999 INFO L168 Benchmark]: BuchiAutomizer took 21287.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 88.4 MB). Peak memory consumption was 151.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:22:37,999 INFO L168 Benchmark]: Witness Printer took 3.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:22:38,002 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -207.4 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.32 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.57 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. * RCFGBuilder took 194.96 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21287.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 88.4 MB). Peak memory consumption was 151.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.53 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * s1 and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * scanp and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s2] + -1 * scanp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.7s. Construction of modules took 0.1s. Büchi inclusion checks took 6.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 89 SDtfs, 82 SDslu, 73 SDs, 0 SdLazy, 118 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital221 mio100 ax108 hnf99 lsp89 ukn80 mio100 lsp42 div100 bol100 ite100 ukn100 eq191 hnf87 smp97 dnf232 smp90 tf100 neg97 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...