./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/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 61869dea11c33643d44719730b54f6ea8fd7faa2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 18:23:37,526 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 18:23:37,527 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 18:23:37,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 18:23:37,533 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 18:23:37,534 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 18:23:37,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 18:23:37,535 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 18:23:37,536 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 18:23:37,536 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 18:23:37,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 18:23:37,537 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 18:23:37,537 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 18:23:37,538 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 18:23:37,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 18:23:37,539 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 18:23:37,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 18:23:37,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 18:23:37,541 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 18:23:37,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 18:23:37,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 18:23:37,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 18:23:37,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 18:23:37,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 18:23:37,544 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 18:23:37,544 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 18:23:37,545 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 18:23:37,545 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 18:23:37,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 18:23:37,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 18:23:37,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 18:23:37,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 18:23:37,547 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 18:23:37,547 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 18:23:37,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 18:23:37,548 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 18:23:37,548 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 18:23:37,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 18:23:37,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 18:23:37,556 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 18:23:37,556 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 18:23:37,556 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 18:23:37,556 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 18:23:37,556 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 18:23:37,557 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 18:23:37,557 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 18:23:37,558 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 18:23:37,558 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 18:23:37,558 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 18:23:37,558 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 18:23:37,558 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 18:23:37,558 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 18:23:37,558 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 18:23:37,558 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 18:23:37,558 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 18:23:37,559 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 18:23:37,559 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_5d0d01bb-6233-43a6-8328-44a08ae5206a/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 -> 61869dea11c33643d44719730b54f6ea8fd7faa2 [2018-12-01 18:23:37,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 18:23:37,585 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 18:23:37,588 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 18:23:37,589 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 18:23:37,589 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 18:23:37,590 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca_true-termination.c.i [2018-12-01 18:23:37,634 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/data/2c94c968d/ddf9e687454640859444629f2805d6f1/FLAG5377880a6 [2018-12-01 18:23:37,954 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 18:23:37,954 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca_true-termination.c.i [2018-12-01 18:23:37,962 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/data/2c94c968d/ddf9e687454640859444629f2805d6f1/FLAG5377880a6 [2018-12-01 18:23:37,970 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/bin-2019/uautomizer/data/2c94c968d/ddf9e687454640859444629f2805d6f1 [2018-12-01 18:23:37,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 18:23:37,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 18:23:37,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 18:23:37,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 18:23:37,976 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 18:23:37,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:23:37" (1/1) ... [2018-12-01 18:23:37,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264a29c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:37, skipping insertion in model container [2018-12-01 18:23:37,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:23:37" (1/1) ... [2018-12-01 18:23:37,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 18:23:38,001 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 18:23:38,144 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:23:38,150 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 18:23:38,210 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:23:38,229 INFO L195 MainTranslator]: Completed translation [2018-12-01 18:23:38,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38 WrapperNode [2018-12-01 18:23:38,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 18:23:38,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 18:23:38,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 18:23:38,230 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 18:23:38,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... [2018-12-01 18:23:38,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... [2018-12-01 18:23:38,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 18:23:38,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 18:23:38,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 18:23:38,254 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 18:23:38,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... [2018-12-01 18:23:38,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... [2018-12-01 18:23:38,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... [2018-12-01 18:23:38,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... [2018-12-01 18:23:38,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... [2018-12-01 18:23:38,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... [2018-12-01 18:23:38,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... [2018-12-01 18:23:38,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 18:23:38,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 18:23:38,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 18:23:38,269 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 18:23:38,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d0d01bb-6233-43a6-8328-44a08ae5206a/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-12-01 18:23:38,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 18:23:38,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 18:23:38,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 18:23:38,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 18:23:38,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 18:23:38,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 18:23:38,431 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 18:23:38,431 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 18:23:38,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:23:38 BoogieIcfgContainer [2018-12-01 18:23:38,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 18:23:38,432 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 18:23:38,432 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 18:23:38,434 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 18:23:38,435 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:23:38,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 06:23:37" (1/3) ... [2018-12-01 18:23:38,435 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@223fd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:23:38, skipping insertion in model container [2018-12-01 18:23:38,435 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:23:38,435 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:23:38" (2/3) ... [2018-12-01 18:23:38,436 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@223fd78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:23:38, skipping insertion in model container [2018-12-01 18:23:38,436 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:23:38,436 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:23:38" (3/3) ... [2018-12-01 18:23:38,437 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrpbrk-alloca_true-termination.c.i [2018-12-01 18:23:38,468 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 18:23:38,468 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 18:23:38,468 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 18:23:38,468 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 18:23:38,468 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 18:23:38,468 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 18:23:38,468 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 18:23:38,469 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 18:23:38,469 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 18:23:38,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-01 18:23:38,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 18:23:38,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:23:38,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:23:38,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 18:23:38,494 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 18:23:38,494 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 18:23:38,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-12-01 18:23:38,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 18:23:38,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:23:38,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:23:38,495 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 18:23:38,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 18:23:38,500 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 8#L565true assume !(main_~length1~0 < 1); 12#L565-2true assume !(main_~length2~0 < 1); 6#L568-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 3#L552-4true [2018-12-01 18:23:38,500 INFO L796 eck$LassoCheckResult]: Loop: 3#L552-4true call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 14#L552-1true assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 16#L555-5true assume !true; 19#L555-6true call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 5#L557true assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 20#L552-3true cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 3#L552-4true [2018-12-01 18:23:38,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:38,505 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-01 18:23:38,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:38,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:23:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:38,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:38,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2018-12-01 18:23:38,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:38,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:23:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:23:38,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:23:38,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 18:23:38,619 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:23:38,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 18:23:38,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 18:23:38,629 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-12-01 18:23:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:23:38,633 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2018-12-01 18:23:38,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 18:23:38,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2018-12-01 18:23:38,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 18:23:38,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2018-12-01 18:23:38,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-01 18:23:38,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 18:23:38,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-12-01 18:23:38,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:23:38,638 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-01 18:23:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-12-01 18:23:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-01 18:23:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 18:23:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-01 18:23:38,654 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-01 18:23:38,654 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-01 18:23:38,654 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 18:23:38,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-12-01 18:23:38,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-01 18:23:38,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:23:38,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:23:38,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 18:23:38,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:23:38,656 INFO L794 eck$LassoCheckResult]: Stem: 54#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 53#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 49#L565 assume !(main_~length1~0 < 1); 50#L565-2 assume !(main_~length2~0 < 1); 48#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 44#L552-4 [2018-12-01 18:23:38,656 INFO L796 eck$LassoCheckResult]: Loop: 44#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 45#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 56#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 51#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 52#L555-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 55#L555-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 46#L557 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 47#L552-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 44#L552-4 [2018-12-01 18:23:38,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:38,656 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2018-12-01 18:23:38,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:38,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:38,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:23:38,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:38,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2018-12-01 18:23:38,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:38,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:23:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:38,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2018-12-01 18:23:38,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:38,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:23:38,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:38,860 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-12-01 18:23:39,007 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-12-01 18:23:39,150 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2018-12-01 18:23:39,211 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:23:39,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:23:39,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:23:39,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:23:39,213 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:23:39,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:23:39,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:23:39,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:23:39,213 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-termination.c.i_Iteration2_Lasso [2018-12-01 18:23:39,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:23:39,213 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:23:39,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,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-12-01 18:23:39,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,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-12-01 18:23:39,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-12-01 18:23:39,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:39,863 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:23:39,866 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:23:39,867 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-12-01 18:23:39,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:23:39,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,873 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-12-01 18:23:39,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:23:39,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,876 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-12-01 18:23:39,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:23:39,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:23:39,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:23:39,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,881 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-12-01 18:23:39,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,883 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-12-01 18:23:39,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:23:39,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:23:39,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:23:39,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,889 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-12-01 18:23:39,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,890 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-12-01 18:23:39,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:23:39,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:23:39,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:23:39,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,897 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-12-01 18:23:39,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 18:23:39,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:39,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:39,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:39,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:39,901 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-12-01 18:23:39,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:39,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:39,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:39,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:39,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:23:39,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:23:39,926 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:23:39,948 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 18:23:39,948 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 18:23:39,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:23:39,951 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 18:23:39,952 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:23:39,952 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0.offset Supporting invariants [] [2018-12-01 18:23:39,981 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-01 18:23:39,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 18:23:40,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:40,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:40,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:23:40,046 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-12-01 18:23:40,046 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-01 18:23:40,086 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2018-12-01 18:23:40,086 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-12-01 18:23:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 18:23:40,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-01 18:23:40,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-01 18:23:40,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:40,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2018-12-01 18:23:40,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:40,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2018-12-01 18:23:40,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:40,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-12-01 18:23:40,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 18:23:40,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2018-12-01 18:23:40,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 18:23:40,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 18:23:40,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2018-12-01 18:23:40,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:23:40,090 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-01 18:23:40,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2018-12-01 18:23:40,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-01 18:23:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-01 18:23:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-12-01 18:23:40,092 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-01 18:23:40,092 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-12-01 18:23:40,092 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 18:23:40,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-12-01 18:23:40,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 18:23:40,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:23:40,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:23:40,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:23:40,092 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 18:23:40,092 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 191#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 185#L565 assume !(main_~length1~0 < 1); 186#L565-2 assume !(main_~length2~0 < 1); 184#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 178#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 180#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 193#L555-5 [2018-12-01 18:23:40,093 INFO L796 eck$LassoCheckResult]: Loop: 193#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 187#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 188#L555-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 193#L555-5 [2018-12-01 18:23:40,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:40,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2018-12-01 18:23:40,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:40,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:40,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:23:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:40,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-12-01 18:23:40,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:40,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:40,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:23:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:40,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:40,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2018-12-01 18:23:40,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:40,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:40,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:40,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:23:40,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:40,400 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-12-01 18:23:40,465 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:23:40,465 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:23:40,465 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:23:40,465 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:23:40,465 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:23:40,465 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:23:40,465 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:23:40,465 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:23:40,465 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-01 18:23:40,465 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:23:40,465 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:23:40,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:40,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:41,085 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:23:41,085 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:23:41,085 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-12-01 18:23:41,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:41,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:41,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:41,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:41,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:41,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:41,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:41,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:41,087 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-12-01 18:23:41,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:41,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:41,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:41,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:41,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:41,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:41,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:41,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:41,089 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-12-01 18:23:41,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:41,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:41,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:41,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:41,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:41,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:41,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:41,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:41,090 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-12-01 18:23:41,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:41,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:41,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:41,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:41,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:41,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:41,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:41,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:41,092 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-12-01 18:23:41,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:41,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:41,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:41,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:41,093 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:23:41,093 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:23:41,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:41,094 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-12-01 18:23:41,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:41,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:41,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:41,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:41,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:23:41,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:23:41,110 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:23:41,117 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 18:23:41,118 INFO L444 ModelExtractionUtils]: 39 out of 43 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 18:23:41,118 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:23:41,119 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 18:23:41,119 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:23:41,119 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [] [2018-12-01 18:23:41,152 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-12-01 18:23:41,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 18:23:41,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:41,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:41,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:23:41,214 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-12-01 18:23:41,214 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-12-01 18:23:41,242 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2018-12-01 18:23:41,242 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-12-01 18:23:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 18:23:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-01 18:23:41,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2018-12-01 18:23:41,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:41,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2018-12-01 18:23:41,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:41,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2018-12-01 18:23:41,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:41,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-12-01 18:23:41,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 18:23:41,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2018-12-01 18:23:41,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 18:23:41,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 18:23:41,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2018-12-01 18:23:41,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:23:41,246 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2018-12-01 18:23:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2018-12-01 18:23:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2018-12-01 18:23:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-01 18:23:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-12-01 18:23:41,248 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-01 18:23:41,248 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-12-01 18:23:41,248 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 18:23:41,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-12-01 18:23:41,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 18:23:41,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:23:41,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:23:41,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:23:41,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 18:23:41,250 INFO L794 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 366#L565 assume !(main_~length1~0 < 1); 367#L565-2 assume !(main_~length2~0 < 1); 365#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 358#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 359#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 375#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 380#L555-1 assume !cstrpbrk_#t~short7; 379#L555-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 378#L555-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 363#L557 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 364#L552-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 360#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 362#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 374#L555-5 [2018-12-01 18:23:41,250 INFO L796 eck$LassoCheckResult]: Loop: 374#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 368#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 369#L555-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 374#L555-5 [2018-12-01 18:23:41,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:41,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2018-12-01 18:23:41,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:41,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:41,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:23:41,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:23:41,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:23:41,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 18:23:41,306 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 18:23:41,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-12-01 18:23:41,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:41,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:41,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:23:41,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 18:23:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-01 18:23:41,418 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-12-01 18:23:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:23:41,460 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2018-12-01 18:23:41,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 18:23:41,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2018-12-01 18:23:41,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-01 18:23:41,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2018-12-01 18:23:41,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-01 18:23:41,461 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 18:23:41,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2018-12-01 18:23:41,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 18:23:41,461 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-01 18:23:41,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2018-12-01 18:23:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-01 18:23:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-01 18:23:41,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-01 18:23:41,462 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-01 18:23:41,463 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-01 18:23:41,463 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 18:23:41,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2018-12-01 18:23:41,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-01 18:23:41,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:23:41,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:23:41,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:23:41,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 18:23:41,463 INFO L794 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 444#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14.base, main_#t~ret14.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 438#L565 assume !(main_~length1~0 < 1); 439#L565-2 assume !(main_~length2~0 < 1); 437#L568-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem4, cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset, cstrpbrk_#t~mem5, cstrpbrk_#t~mem6, cstrpbrk_#t~short7, cstrpbrk_#t~mem9, cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset, cstrpbrk_#t~mem3, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 430#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 431#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 447#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 448#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 450#L555-3 assume !cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5; 449#L555-6 call cstrpbrk_#t~mem9 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 435#L557 assume !(cstrpbrk_#t~mem9 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem9; 436#L552-3 cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post2.base, 1 + cstrpbrk_#t~post2.offset;havoc cstrpbrk_#t~post2.base, cstrpbrk_#t~post2.offset; 432#L552-4 call cstrpbrk_#t~mem3 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 434#L552-1 assume !!(0 != cstrpbrk_#t~mem3);havoc cstrpbrk_#t~mem3;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem4 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem4;havoc cstrpbrk_#t~mem4; 446#L555-5 [2018-12-01 18:23:41,463 INFO L796 eck$LassoCheckResult]: Loop: 446#L555-5 call cstrpbrk_#t~mem5 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := 0 != cstrpbrk_#t~mem5; 440#L555-1 assume cstrpbrk_#t~short7;call cstrpbrk_#t~mem6 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short7 := cstrpbrk_#t~mem6 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 441#L555-3 assume !!cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem6;havoc cstrpbrk_#t~short7;havoc cstrpbrk_#t~mem5;cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post8.base, 1 + cstrpbrk_#t~post8.offset;havoc cstrpbrk_#t~post8.base, cstrpbrk_#t~post8.offset; 446#L555-5 [2018-12-01 18:23:41,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:41,464 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2018-12-01 18:23:41,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:41,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:23:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:41,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-12-01 18:23:41,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:41,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:41,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:23:41,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:41,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2018-12-01 18:23:41,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:23:41,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:23:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:23:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:23:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:23:41,976 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 134 [2018-12-01 18:23:42,622 WARN L180 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 106 [2018-12-01 18:23:42,625 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:23:42,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:23:42,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:23:42,625 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:23:42,625 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:23:42,625 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:23:42,625 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:23:42,625 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:23:42,625 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrpbrk-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-01 18:23:42,625 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:23:42,625 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:23:42,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:42,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:42,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:42,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:42,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:42,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:42,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:42,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:42,780 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-01 18:23:43,163 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2018-12-01 18:23:43,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:23:43,644 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 113 [2018-12-01 18:23:45,625 WARN L180 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 137 DAG size of output: 108 [2018-12-01 18:23:46,163 WARN L180 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2018-12-01 18:23:46,189 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:23:46,190 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:23:46,190 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-12-01 18:23:46,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:46,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:46,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:46,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:46,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:46,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:46,191 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-12-01 18:23:46,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:46,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:46,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:46,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:46,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:46,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:46,193 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-12-01 18:23:46,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:46,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:46,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:46,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:46,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:46,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:46,194 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-12-01 18:23:46,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:46,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:46,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:46,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:46,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:46,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:46,195 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-12-01 18:23:46,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:46,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:46,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:46,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:46,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:46,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:46,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-12-01 18:23:46,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:46,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:46,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:23:46,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:23:46,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:46,198 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-12-01 18:23:46,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:23:46,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:46,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:46,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:23:46,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:23:46,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:46,200 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-12-01 18:23:46,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:23:46,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:46,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:23:46,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:23:46,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:46,204 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-12-01 18:23:46,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,204 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 18:23:46,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:23:46,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:23:46,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 18:23:46,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:23:46,209 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-12-01 18:23:46,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:23:46,210 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2018-12-01 18:23:46,210 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-12-01 18:23:46,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:23:46,285 INFO L402 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2018-12-01 18:23:46,285 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-12-01 18:23:48,061 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 18:23:49,213 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2018-12-01 18:23:49,213 INFO L444 ModelExtractionUtils]: 337 out of 352 variables were initially zero. Simplification set additionally 12 variables to zero. [2018-12-01 18:23:49,213 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 18:23:49,216 INFO L440 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2018-12-01 18:23:49,216 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 18:23:49,216 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2018-12-01 18:23:49,283 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2018-12-01 18:23:49,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 18:23:49,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:49,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:49,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:23:49,327 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-12-01 18:23:49,327 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-01 18:23:49,349 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-12-01 18:23:49,349 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-12-01 18:23:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 18:23:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-01 18:23:49,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-01 18:23:49,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:49,350 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 18:23:49,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:49,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:49,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:23:49,397 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-01 18:23:49,397 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-01 18:23:49,417 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-12-01 18:23:49,418 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-12-01 18:23:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 18:23:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-01 18:23:49,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-01 18:23:49,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:49,418 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 18:23:49,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:23:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:49,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:23:49,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 18:23:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:23:49,462 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-01 18:23:49,462 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-01 18:23:49,483 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2018-12-01 18:23:49,484 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-12-01 18:23:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 18:23:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-01 18:23:49,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2018-12-01 18:23:49,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:49,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2018-12-01 18:23:49,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:49,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-01 18:23:49,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 18:23:49,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2018-12-01 18:23:49,486 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 18:23:49,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-01 18:23:49,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 18:23:49,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 18:23:49,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 18:23:49,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:23:49,486 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:23:49,486 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:23:49,486 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 18:23:49,486 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 18:23:49,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 18:23:49,486 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 18:23:49,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 18:23:49,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 06:23:49 BoogieIcfgContainer [2018-12-01 18:23:49,490 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 18:23:49,490 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 18:23:49,490 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 18:23:49,491 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 18:23:49,491 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:23:38" (3/4) ... [2018-12-01 18:23:49,493 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 18:23:49,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 18:23:49,493 INFO L168 Benchmark]: Toolchain (without parser) took 11520.85 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 640.7 MB). Free memory was 955.9 MB in the beginning and 1.2 GB in the end (delta: -250.0 MB). Peak memory consumption was 390.7 MB. Max. memory is 11.5 GB. [2018-12-01 18:23:49,494 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:23:49,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-01 18:23:49,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:23:49,494 INFO L168 Benchmark]: Boogie Preprocessor took 15.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:23:49,495 INFO L168 Benchmark]: RCFGBuilder took 162.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-01 18:23:49,495 INFO L168 Benchmark]: BuchiAutomizer took 11058.26 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 501.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -125.6 MB). Peak memory consumption was 376.2 MB. Max. memory is 11.5 GB. [2018-12-01 18:23:49,495 INFO L168 Benchmark]: Witness Printer took 2.44 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-01 18:23:49,497 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 955.9 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 162.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11058.26 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 501.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -125.6 MB). Peak memory consumption was 376.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.44 ms. Allocated memory is still 1.7 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. 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 * sc1 and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 10.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 105 SDtfs, 91 SDslu, 72 SDs, 0 SdLazy, 105 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital365 mio100 ax105 hnf99 lsp87 ukn71 mio100 lsp68 div122 bol100 ite100 ukn100 eq172 hnf83 smp79 dnf1116 smp24 tf100 neg97 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 3006ms VariablesStem: 28 VariablesLoop: 16 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 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...