./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:03:53,264 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:03:53,266 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:03:53,274 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:03:53,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:03:53,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:03:53,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:03:53,278 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:03:53,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:03:53,280 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:03:53,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:03:53,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:03:53,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:03:53,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:03:53,284 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:03:53,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:03:53,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:03:53,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:03:53,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:03:53,291 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:03:53,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:03:53,293 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:03:53,295 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:03:53,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:03:53,296 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:03:53,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:03:53,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:03:53,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:03:53,300 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:03:53,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:03:53,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:03:53,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:03:53,302 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:03:53,302 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:03:53,303 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:03:53,304 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:03:53,304 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 06:03:53,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:03:53,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:03:53,320 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:03:53,320 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:03:53,320 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:03:53,320 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:03:53,320 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:03:53,321 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:03:53,321 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:03:53,322 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:03:53,322 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:03:53,322 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:03:53,322 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:03:53,322 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:03:53,323 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:03:53,323 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:03:53,323 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:03:53,323 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:03:53,323 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:03:53,324 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:03:53,324 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:03:53,324 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:03:53,324 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:03:53,324 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:03:53,324 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:03:53,325 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:03:53,325 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:03:53,326 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:03:53,327 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:03:53,327 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:03:53,328 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:03:53,328 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_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b05f69771eccbce2f5fc7c2cfa048f17b18a2bd9 [2018-11-10 06:03:53,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:03:53,370 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:03:53,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:03:53,375 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:03:53,375 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:03:53,376 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 06:03:53,433 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/data/8325a90eb/8f4386d7a52e41de8844eb4a52240a7d/FLAG1a6cbe97f [2018-11-10 06:03:53,846 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:03:53,847 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/sv-benchmarks/c/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 06:03:53,858 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/data/8325a90eb/8f4386d7a52e41de8844eb4a52240a7d/FLAG1a6cbe97f [2018-11-10 06:03:53,868 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/data/8325a90eb/8f4386d7a52e41de8844eb4a52240a7d [2018-11-10 06:03:53,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:03:53,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:03:53,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:03:53,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:03:53,877 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:03:53,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:53" (1/1) ... [2018-11-10 06:03:53,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c80a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:53, skipping insertion in model container [2018-11-10 06:03:53,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:53" (1/1) ... [2018-11-10 06:03:53,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:03:53,922 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:03:54,139 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:03:54,148 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:03:54,184 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:03:54,221 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:03:54,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54 WrapperNode [2018-11-10 06:03:54,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:03:54,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:03:54,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:03:54,222 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:03:54,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2018-11-10 06:03:54,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2018-11-10 06:03:54,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:03:54,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:03:54,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:03:54,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:03:54,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2018-11-10 06:03:54,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2018-11-10 06:03:54,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2018-11-10 06:03:54,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2018-11-10 06:03:54,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2018-11-10 06:03:54,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2018-11-10 06:03:54,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... [2018-11-10 06:03:54,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:03:54,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:03:54,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:03:54,331 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:03:54,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:03:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 06:03:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 06:03:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:03:54,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:03:54,567 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:03:54,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:03:54 BoogieIcfgContainer [2018-11-10 06:03:54,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:03:54,569 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:03:54,569 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:03:54,574 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:03:54,575 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:03:54,575 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:03:53" (1/3) ... [2018-11-10 06:03:54,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78ca72ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:03:54, skipping insertion in model container [2018-11-10 06:03:54,576 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:03:54,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:54" (2/3) ... [2018-11-10 06:03:54,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78ca72ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:03:54, skipping insertion in model container [2018-11-10 06:03:54,577 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:03:54,578 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:03:54" (3/3) ... [2018-11-10 06:03:54,580 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 06:03:54,619 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:03:54,619 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:03:54,619 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:03:54,620 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:03:54,620 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:03:54,620 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:03:54,620 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:03:54,620 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:03:54,620 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:03:54,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 06:03:54,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 06:03:54,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:03:54,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:03:54,657 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:03:54,658 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:03:54,658 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:03:54,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-10 06:03:54,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 06:03:54,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:03:54,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:03:54,660 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:03:54,660 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:03:54,669 INFO L793 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 6#L557true assume !(main_~length1~0 < 1); 12#L557-2true assume !(main_~length2~0 < 1); 23#L560-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 14#L565true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 16#L565-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L565-1 11#L566true assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 17#L545-3true [2018-11-10 06:03:54,669 INFO L795 eck$LassoCheckResult]: Loop: 17#L545-3true assume true; 13#L545-1true assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 7#L546true SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L546 9#L546-1true cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;havoc cstrcspn_#t~mem3;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 10#L548-3true assume !true; 17#L545-3true [2018-11-10 06:03:54,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 06:03:54,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:54,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:54,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:03:54,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:54,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:54,798 INFO L82 PathProgramCache]: Analyzing trace with hash 49778825, now seen corresponding path program 1 times [2018-11-10 06:03:54,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:54,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:54,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:03:54,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:03:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:03:54,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:03:54,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-10 06:03:54,831 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:03:54,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 06:03:54,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:03:54,845 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-10 06:03:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:03:54,851 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-10 06:03:54,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:03:54,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-10 06:03:54,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 06:03:54,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 20 transitions. [2018-11-10 06:03:54,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 06:03:54,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-10 06:03:54,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-10 06:03:54,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:03:54,861 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 06:03:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-10 06:03:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 06:03:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 06:03:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-10 06:03:54,885 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 06:03:54,885 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 06:03:54,885 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:03:54,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-11-10 06:03:54,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 06:03:54,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:03:54,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:03:54,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:03:54,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:03:54,887 INFO L793 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 65#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 55#L557 assume !(main_~length1~0 < 1); 56#L557-2 assume !(main_~length2~0 < 1); 61#L560-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 63#L565 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 64#L565-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L565-1 60#L566 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 53#L545-3 [2018-11-10 06:03:54,888 INFO L795 eck$LassoCheckResult]: Loop: 53#L545-3 assume true; 62#L545-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 57#L546 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L546 58#L546-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;havoc cstrcspn_#t~mem3;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 54#L548-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 59#L549 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L549 50#L549-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 51#L549-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset;havoc cstrcspn_#t~mem5; 52#L548-1 assume !(cstrcspn_~sc~0 != 0); 53#L545-3 [2018-11-10 06:03:54,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:54,888 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 06:03:54,888 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:54,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:54,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:03:54,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:54,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:54,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1552498561, now seen corresponding path program 1 times [2018-11-10 06:03:54,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:54,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:54,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:03:54,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:54,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1454924651, now seen corresponding path program 1 times [2018-11-10 06:03:54,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:54,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:54,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:03:54,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:55,110 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-10 06:03:55,471 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 06:03:55,576 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-10 06:03:55,587 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:03:55,588 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:03:55,588 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:03:55,588 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:03:55,588 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:03:55,588 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:03:55,589 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:03:55,589 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:03:55,589 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-10 06:03:55,589 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:03:55,590 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:03:55,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:55,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:55,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:55,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:55,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:55,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:55,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-11-10 06:03:55,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:55,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:55,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:56,011 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-11-10 06:03:56,146 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-10 06:03:56,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:56,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:56,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:56,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:56,656 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:03:56,660 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:03:56,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:56,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:56,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:56,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:56,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:56,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:56,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:56,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:56,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:56,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:56,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:56,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:56,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:56,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:56,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:56,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:56,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:56,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:56,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:56,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:56,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:56,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:56,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:56,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:56,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:56,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:56,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:56,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,719 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:03:56,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,723 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:03:56,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:56,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,743 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:03:56,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,745 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:03:56,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:56,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:56,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:56,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:56,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:56,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,806 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:03:56,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,809 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:03:56,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:56,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:56,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:56,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:56,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:56,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:56,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:56,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:56,869 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:03:56,911 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 06:03:56,911 INFO L444 ModelExtractionUtils]: 51 out of 58 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 06:03:56,913 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:03:56,915 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:03:56,915 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:03:56,916 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1, ULTIMATE.start_cstrcspn_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 - 1*ULTIMATE.start_cstrcspn_~p~0.offset Supporting invariants [] [2018-11-10 06:03:56,991 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-10 06:03:56,998 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 06:03:57,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:03:57,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:03:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:03:57,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:03:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:03:57,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 06:03:57,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 06:03:57,199 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 28 states and 33 transitions. Complement of second has 7 states. [2018-11-10 06:03:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:03:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 06:03:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-10 06:03:57,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 9 letters. [2018-11-10 06:03:57,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:03:57,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 17 letters. Loop has 9 letters. [2018-11-10 06:03:57,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:03:57,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 8 letters. Loop has 18 letters. [2018-11-10 06:03:57,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:03:57,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 06:03:57,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 06:03:57,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 24 states and 28 transitions. [2018-11-10 06:03:57,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 06:03:57,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 06:03:57,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-10 06:03:57,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:03:57,208 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 06:03:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-10 06:03:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-10 06:03:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 06:03:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 06:03:57,210 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 06:03:57,210 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 06:03:57,211 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:03:57,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 06:03:57,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 06:03:57,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:03:57,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:03:57,212 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:03:57,212 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:03:57,212 INFO L793 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 247#L557 assume !(main_~length1~0 < 1); 248#L557-2 assume !(main_~length2~0 < 1); 255#L560-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 257#L565 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 258#L565-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L565-1 253#L566 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 254#L545-3 assume true; 256#L545-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 249#L546 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L546 250#L546-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;havoc cstrcspn_#t~mem3;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 244#L548-3 [2018-11-10 06:03:57,213 INFO L795 eck$LassoCheckResult]: Loop: 244#L548-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 251#L549 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L549 238#L549-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 239#L549-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset;havoc cstrcspn_#t~mem5; 242#L548-1 assume !!(cstrcspn_~sc~0 != 0); 244#L548-3 [2018-11-10 06:03:57,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash -798495055, now seen corresponding path program 1 times [2018-11-10 06:03:57,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:57,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:57,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:57,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:03:57,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:57,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash 60153159, now seen corresponding path program 1 times [2018-11-10 06:03:57,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:57,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:57,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:57,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:03:57,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:57,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:57,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1454924649, now seen corresponding path program 1 times [2018-11-10 06:03:57,245 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:57,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:57,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:57,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:03:57,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:57,634 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 114 [2018-11-10 06:03:57,741 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 06:03:57,742 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:03:57,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:03:57,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:03:57,743 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:03:57,743 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:03:57,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:03:57,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:03:57,743 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:03:57,743 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 06:03:57,743 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:03:57,743 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:03:57,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:57,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:57,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:57,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:57,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:57,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:57,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:57,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:57,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:58,009 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 96 [2018-11-10 06:03:58,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:58,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:58,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:58,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:58,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:58,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:03:58,667 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:03:58,667 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:03:58,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:58,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:58,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:58,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:58,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:58,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:58,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:58,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:58,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:58,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:58,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:58,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:58,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:58,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:58,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:58,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:58,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:58,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:03:58,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:03:58,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:03:58,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:58,689 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:58,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:58,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:58,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,696 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-10 06:03:58,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,708 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-10 06:03:58,708 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-10 06:03:58,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:58,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:58,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,758 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:03:58,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,760 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:03:58,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:58,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:03:58,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:03:58,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:03:58,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:03:58,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:03:58,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:03:58,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:03:58,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:03:58,795 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:03:58,815 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 06:03:58,815 INFO L444 ModelExtractionUtils]: 62 out of 67 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 06:03:58,815 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:03:58,816 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:03:58,816 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:03:58,816 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~spanp~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2) = -1*ULTIMATE.start_cstrcspn_~spanp~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 Supporting invariants [] [2018-11-10 06:03:58,885 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2018-11-10 06:03:58,887 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 06:03:58,888 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 06:03:58,888 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 06:03:58,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:03:58,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:03:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:03:58,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:03:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:03:59,020 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-10 06:03:59,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-10 06:03:59,164 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 55 states and 63 transitions. Complement of second has 9 states. [2018-11-10 06:03:59,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:03:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 06:03:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-10 06:03:59,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 06:03:59,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:03:59,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 06:03:59,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:03:59,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 06:03:59,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:03:59,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 63 transitions. [2018-11-10 06:03:59,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 06:03:59,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 38 states and 44 transitions. [2018-11-10 06:03:59,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 06:03:59,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 06:03:59,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2018-11-10 06:03:59,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:03:59,170 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 44 transitions. [2018-11-10 06:03:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2018-11-10 06:03:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2018-11-10 06:03:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 06:03:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-10 06:03:59,172 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-10 06:03:59,173 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-10 06:03:59,173 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:03:59,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 38 transitions. [2018-11-10 06:03:59,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 06:03:59,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:03:59,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:03:59,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:03:59,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:03:59,175 INFO L793 eck$LassoCheckResult]: Stem: 495#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 478#L557 assume !(main_~length1~0 < 1); 479#L557-2 assume !(main_~length2~0 < 1); 488#L560-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 490#L565 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 491#L565-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L565-1 486#L566 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 487#L545-3 assume true; 493#L545-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 498#L546 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L546 482#L546-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;havoc cstrcspn_#t~mem3;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 477#L548-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 496#L549 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L549 497#L549-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 473#L549-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset;havoc cstrcspn_#t~mem5; 474#L548-1 assume !(cstrcspn_~sc~0 != 0); 494#L545-3 assume true; 489#L545-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 480#L546 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L546 481#L546-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;havoc cstrcspn_#t~mem3;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 475#L548-3 [2018-11-10 06:03:59,175 INFO L795 eck$LassoCheckResult]: Loop: 475#L548-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 483#L549 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L549 468#L549-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 469#L549-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset;havoc cstrcspn_#t~mem5; 472#L548-1 assume !!(cstrcspn_~sc~0 != 0); 475#L548-3 [2018-11-10 06:03:59,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:59,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1280815899, now seen corresponding path program 2 times [2018-11-10 06:03:59,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:59,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:59,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:03:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:59,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash 60153159, now seen corresponding path program 2 times [2018-11-10 06:03:59,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:59,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:59,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:59,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:03:59,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:03:59,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:03:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1970539117, now seen corresponding path program 1 times [2018-11-10 06:03:59,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:03:59,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:03:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:59,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:03:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:03:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:03:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:03:59,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:03:59,308 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c26b14e2-6103-4fb1-90f8-2e702204b883/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:03:59,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:03:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:03:59,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:03:59,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-10 06:03:59,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 06:03:59,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:03:59,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:03:59,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 06:03:59,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-11-10 06:04:25,516 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 06:04:28,553 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 06:04:31,411 WARN L179 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 06:04:31,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 06:04:31,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-11-10 06:04:31,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:04:31,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:04:31,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:04:31,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-11-10 06:04:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:04:31,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:04:31,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2018-11-10 06:04:31,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 06:04:31,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=327, Unknown=4, NotChecked=0, Total=380 [2018-11-10 06:04:31,477 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. cyclomatic complexity: 8 Second operand 20 states. [2018-11-10 06:04:33,602 WARN L179 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2018-11-10 06:04:38,073 WARN L179 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-11-10 06:04:40,748 WARN L179 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2018-11-10 06:04:43,967 WARN L179 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-11-10 06:04:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:04:44,051 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-10 06:04:44,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 06:04:44,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2018-11-10 06:04:44,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 06:04:44,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 57 states and 63 transitions. [2018-11-10 06:04:44,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 06:04:44,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 06:04:44,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 63 transitions. [2018-11-10 06:04:44,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:04:44,054 INFO L705 BuchiCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-11-10 06:04:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 63 transitions. [2018-11-10 06:04:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 41. [2018-11-10 06:04:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 06:04:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-10 06:04:44,058 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-10 06:04:44,058 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-10 06:04:44,058 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:04:44,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 46 transitions. [2018-11-10 06:04:44,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 06:04:44,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:04:44,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:04:44,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:04:44,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:04:44,060 INFO L793 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 729#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~ret10, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 714#L557 assume !(main_~length1~0 < 1); 715#L557-2 assume !(main_~length2~0 < 1); 724#L560-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length1~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length2~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 727#L565 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L565 728#L565-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L565-1 722#L566 assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, cstrcspn_#t~mem3, cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, cstrcspn_#t~mem5, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~p~0.base, cstrcspn_~p~0.offset, cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset, cstrcspn_~c~0, cstrcspn_~sc~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~p~0.base, cstrcspn_~p~0.offset;havoc cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;havoc cstrcspn_~c~0;havoc cstrcspn_~sc~0;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 723#L545-3 assume true; 725#L545-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 726#L546 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L546 720#L546-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;havoc cstrcspn_#t~mem3;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 721#L548-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 740#L549 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L549 707#L549-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 708#L549-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset;havoc cstrcspn_#t~mem5; 710#L548-1 assume !!(cstrcspn_~sc~0 != 0); 744#L548-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 743#L549 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L549 741#L549-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 742#L549-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset;havoc cstrcspn_#t~mem5; 734#L548-1 assume !(cstrcspn_~sc~0 != 0); 730#L545-3 assume true; 731#L545-1 assume !false;cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset := cstrcspn_~p~0.base, cstrcspn_~p~0.offset;cstrcspn_~p~0.base, cstrcspn_~p~0.offset := cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset + 1; 716#L546 SUMMARY for call cstrcspn_#t~mem3 := read~int(cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset, 1); srcloc: L546 717#L546-1 cstrcspn_~c~0 := cstrcspn_#t~mem3;havoc cstrcspn_#t~post2.base, cstrcspn_#t~post2.offset;havoc cstrcspn_#t~mem3;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 711#L548-3 [2018-11-10 06:04:44,060 INFO L795 eck$LassoCheckResult]: Loop: 711#L548-3 assume true;cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset := cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset;cstrcspn_~spanp~0.base, cstrcspn_~spanp~0.offset := cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset + 1; 718#L549 SUMMARY for call cstrcspn_#t~mem5 := read~int(cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset, 1); srcloc: L549 705#L549-1 cstrcspn_~sc~0 := cstrcspn_#t~mem5; 706#L549-2 assume !(cstrcspn_~sc~0 == cstrcspn_~c~0);havoc cstrcspn_#t~post4.base, cstrcspn_#t~post4.offset;havoc cstrcspn_#t~mem5; 709#L548-1 assume !!(cstrcspn_~sc~0 != 0); 711#L548-3 [2018-11-10 06:04:44,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash 432424949, now seen corresponding path program 2 times [2018-11-10 06:04:44,060 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:04:44,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:04:44,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:44,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:04:44,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:04:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:04:44,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash 60153159, now seen corresponding path program 3 times [2018-11-10 06:04:44,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:04:44,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:04:44,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:44,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:04:44,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:04:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:04:44,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:44,087 INFO L82 PathProgramCache]: Analyzing trace with hash -570266157, now seen corresponding path program 3 times [2018-11-10 06:04:44,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:04:44,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:04:44,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:44,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:04:44,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:04:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:04:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:04:44,738 WARN L179 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 172 [2018-11-10 06:04:44,871 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-10 06:04:44,872 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:04:44,872 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:04:44,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:04:44,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:04:44,872 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:04:44,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:04:44,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:04:44,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:04:44,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-10 06:04:44,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:04:44,873 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:04:44,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:44,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:44,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:44,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:44,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:44,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,323 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2018-11-10 06:04:45,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:04:45,566 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-11-10 06:04:45,991 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-10 06:04:46,081 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:04:46,081 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:04:46,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:04:46,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:04:46,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:04:46,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:04:46,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:04:46,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:04:46,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:04:46,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:04:46,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:04:46,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:04:46,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:04:46,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:04:46,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:04:46,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:04:46,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:04:46,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:04:46,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:04:46,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:04:46,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-11-10 06:04:46,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:04:46,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:04:46,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:04:46,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:04:46,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:04:46,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:04:46,087 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:04:46,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-11-10 06:04:46,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:04:46,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:04:46,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:04:46,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:04:46,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:04:46,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:04:46,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:04:46,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:04:46,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:04:46,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:04:46,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:04:46,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:04:46,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:04:46,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:04:46,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:04:46,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:04:46,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:04:46,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-11-10 06:04:46,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:04:46,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:04:46,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:04:46,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:04:46,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:04:46,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:04:46,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:04:46,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:04:46,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:04:46,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:04:46,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:04:46,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:04:46,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:04:46,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:04:46,130 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:04:46,154 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 06:04:46,154 INFO L444 ModelExtractionUtils]: 62 out of 67 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 06:04:46,155 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:04:46,155 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:04:46,156 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:04:46,156 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_cstrcspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_cstrcspn_~spanp~0.offset Supporting invariants [] [2018-11-10 06:04:46,280 INFO L297 tatePredicateManager]: 31 out of 32 supporting invariants were superfluous and have been removed [2018-11-10 06:04:46,282 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 06:04:46,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:46,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:04:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:46,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:04:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:04:46,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 06:04:46,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 06:04:46,451 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 56 states and 63 transitions. Complement of second has 8 states. [2018-11-10 06:04:46,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:04:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 06:04:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-10 06:04:46,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-10 06:04:46,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:04:46,452 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:04:46,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:46,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:04:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:46,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:04:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:04:46,537 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-10 06:04:46,537 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 06:04:46,599 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 57 states and 64 transitions. Complement of second has 10 states. [2018-11-10 06:04:46,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 06:04:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 06:04:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-10 06:04:46,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-10 06:04:46,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:04:46,600 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 06:04:46,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:04:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:46,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:04:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:04:46,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:04:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:04:46,672 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 3 loop predicates [2018-11-10 06:04:46,673 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 06:04:46,719 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 46 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 65 states and 73 transitions. Complement of second has 7 states. [2018-11-10 06:04:46,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 06:04:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 06:04:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-10 06:04:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 26 letters. Loop has 5 letters. [2018-11-10 06:04:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:04:46,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 31 letters. Loop has 5 letters. [2018-11-10 06:04:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:04:46,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 26 letters. Loop has 10 letters. [2018-11-10 06:04:46,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:04:46,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2018-11-10 06:04:46,724 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:04:46,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2018-11-10 06:04:46,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 06:04:46,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 06:04:46,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 06:04:46,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:04:46,725 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:04:46,725 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:04:46,725 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:04:46,725 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 06:04:46,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:04:46,725 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:04:46,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 06:04:46,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:04:46 BoogieIcfgContainer [2018-11-10 06:04:46,732 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:04:46,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:04:46,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:04:46,733 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:04:46,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:03:54" (3/4) ... [2018-11-10 06:04:46,737 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 06:04:46,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:04:46,738 INFO L168 Benchmark]: Toolchain (without parser) took 52865.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 382.2 MB). Free memory was 956.5 MB in the beginning and 1.3 GB in the end (delta: -331.9 MB). Peak memory consumption was 50.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:04:46,739 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:04:46,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.74 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:04:46,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:04:46,740 INFO L168 Benchmark]: Boogie Preprocessor took 20.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:04:46,740 INFO L168 Benchmark]: RCFGBuilder took 237.28 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-10 06:04:46,741 INFO L168 Benchmark]: BuchiAutomizer took 52163.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.4 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:04:46,741 INFO L168 Benchmark]: Witness Printer took 4.48 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:04:46,744 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.74 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 935.0 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.26 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 237.28 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.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 52163.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.4 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.48 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 * p and consists of 5 locations. One deterministic module has affine ranking function -1 * spanp + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * spanp and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 52.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 38.4s. Construction of modules took 0.2s. Büchi inclusion checks took 13.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 41 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 138 SDtfs, 181 SDslu, 258 SDs, 0 SdLazy, 293 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax100 hnf99 lsp96 ukn104 mio100 lsp44 div100 bol100 ite100 ukn100 eq201 hnf85 smp96 dnf134 smp90 tf100 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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...