./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-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_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/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 1f6e8c8b965f85c3429105401e9fda59f9f060cb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:22:56,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:22:56,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:22:56,262 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:22:56,263 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:22:56,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:22:56,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:22:56,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:22:56,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:22:56,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:22:56,268 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:22:56,268 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:22:56,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:22:56,269 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:22:56,270 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:22:56,270 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:22:56,271 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:22:56,272 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:22:56,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:22:56,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:22:56,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:22:56,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:22:56,278 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:22:56,278 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:22:56,278 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:22:56,279 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:22:56,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:22:56,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:22:56,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:22:56,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:22:56,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:22:56,282 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:22:56,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:22:56,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:22:56,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:22:56,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:22:56,284 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:22:56,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:22:56,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:22:56,293 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:22:56,293 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:22:56,293 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:22:56,293 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:22:56,293 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:22:56,293 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:22:56,294 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:22:56,294 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:22:56,294 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:22:56,294 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:22:56,294 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:22:56,294 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:22:56,295 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:22:56,295 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:22:56,295 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:22:56,295 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:22:56,295 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:22:56,295 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:22:56,295 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:22:56,296 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:22:56,296 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:22:56,296 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:22:56,296 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:22:56,296 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:22:56,296 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:22:56,297 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:22:56,297 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:22:56,297 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:22:56,298 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:22:56,298 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_c9adbd62-ca2b-4337-b18c-b92b86177853/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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2018-11-10 03:22:56,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:22:56,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:22:56,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:22:56,330 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:22:56,331 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:22:56,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:22:56,366 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/data/fc46d73aa/fde7c18037a049dc8eadc522a9c95c1d/FLAG72a8daa66 [2018-11-10 03:22:56,697 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:22:56,698 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:22:56,706 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/data/fc46d73aa/fde7c18037a049dc8eadc522a9c95c1d/FLAG72a8daa66 [2018-11-10 03:22:56,715 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/bin-2019/uautomizer/data/fc46d73aa/fde7c18037a049dc8eadc522a9c95c1d [2018-11-10 03:22:56,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:22:56,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:22:56,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:22:56,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:22:56,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:22:56,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:56,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7828c743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56, skipping insertion in model container [2018-11-10 03:22:56,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:56,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:22:56,753 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:22:56,919 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:22:56,926 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:22:56,951 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:22:56,981 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:22:56,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56 WrapperNode [2018-11-10 03:22:56,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:22:56,982 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:22:56,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:22:56,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:22:57,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:57,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:57,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:22:57,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:22:57,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:22:57,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:22:57,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:57,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:57,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:57,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:57,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:57,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:57,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... [2018-11-10 03:22:57,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:22:57,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:22:57,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:22:57,078 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:22:57,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9adbd62-ca2b-4337-b18c-b92b86177853/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 03:22:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 03:22:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 03:22:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:22:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:22:57,316 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:22:57,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:22:57 BoogieIcfgContainer [2018-11-10 03:22:57,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:22:57,317 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:22:57,317 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:22:57,320 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:22:57,321 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:22:57,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:22:56" (1/3) ... [2018-11-10 03:22:57,322 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9604d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:22:57, skipping insertion in model container [2018-11-10 03:22:57,322 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:22:57,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:56" (2/3) ... [2018-11-10 03:22:57,323 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9604d3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:22:57, skipping insertion in model container [2018-11-10 03:22:57,323 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:22:57,323 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:22:57" (3/3) ... [2018-11-10 03:22:57,325 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-11-10 03:22:57,364 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:22:57,364 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:22:57,364 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:22:57,365 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:22:57,365 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:22:57,365 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:22:57,365 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:22:57,365 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:22:57,365 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:22:57,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 03:22:57,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:22:57,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:22:57,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:22:57,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:57,401 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:57,401 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:22:57,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 03:22:57,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:22:57,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:22:57,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:22:57,404 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:57,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:57,411 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 19#L558true assume !(main_~length1~0 < 1); 23#L558-2true assume !(main_~length2~0 < 1); 17#L561-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 7#L566true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 9#L566-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 22#L567true assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 13#L545-5true [2018-11-10 03:22:57,411 INFO L795 eck$LassoCheckResult]: Loop: 13#L545-5true assume true; 24#L545-1true SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 25#L545-2true assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 20#L547true SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 21#L547-1true cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 29#L548-9true assume !true; 30#L548-10true SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-10 15#L550true assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 12#L545-4true cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 13#L545-5true [2018-11-10 03:22:57,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 03:22:57,416 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:57,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:22:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:57,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:57,521 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-11-10 03:22:57,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:57,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:22:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:22:57,548 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 03:22:57,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:22:57,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:22:57,553 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:22:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 03:22:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 03:22:57,564 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 03:22:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:22:57,569 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 03:22:57,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 03:22:57,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 03:22:57,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:22:57,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-11-10 03:22:57,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 03:22:57,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 03:22:57,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 03:22:57,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:22:57,576 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 03:22:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 03:22:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 03:22:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 03:22:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 03:22:57,597 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 03:22:57,597 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 03:22:57,597 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:22:57,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 03:22:57,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 03:22:57,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:22:57,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:22:57,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:57,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:57,599 INFO L793 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 82#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 64#L558 assume !(main_~length1~0 < 1); 65#L558-2 assume !(main_~length2~0 < 1); 74#L561-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 77#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 78#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 72#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 73#L545-5 [2018-11-10 03:22:57,599 INFO L795 eck$LassoCheckResult]: Loop: 73#L545-5 assume true; 79#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 80#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 66#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 67#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 70#L548-9 assume true; 68#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 69#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 71#L548-3 assume !cstrspn_#t~short7; 76#L548-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 84#L548-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-10 86#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 85#L545-4 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 73#L545-5 [2018-11-10 03:22:57,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 03:22:57,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:57,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:22:57,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:57,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:57,627 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-11-10 03:22:57,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:57,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:57,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:22:57,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:22:57,750 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 03:22:57,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:22:57,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 03:22:57,751 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:22:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:22:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:22:57,751 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 10 states. [2018-11-10 03:22:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:22:57,975 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-10 03:22:57,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 03:22:57,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 35 transitions. [2018-11-10 03:22:57,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:22:57,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 33 transitions. [2018-11-10 03:22:57,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 03:22:57,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 03:22:57,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-10 03:22:57,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:22:57,979 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-10 03:22:57,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-10 03:22:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-10 03:22:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 03:22:57,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-10 03:22:57,981 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 03:22:57,981 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-10 03:22:57,982 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:22:57,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-11-10 03:22:57,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 03:22:57,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:22:57,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:22:57,983 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:57,983 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:57,983 INFO L793 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 149#L558 assume !(main_~length1~0 < 1); 150#L558-2 assume !(main_~length2~0 < 1); 159#L561-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 162#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 163#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 157#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 158#L545-5 [2018-11-10 03:22:57,983 INFO L795 eck$LassoCheckResult]: Loop: 158#L545-5 assume true; 164#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 165#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 151#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 152#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 155#L548-9 assume true; 153#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 154#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 156#L548-3 assume cstrspn_#t~short7; 160#L548-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-4 166#L548-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 167#L548-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 172#L548-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-10 171#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 170#L545-4 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 158#L545-5 [2018-11-10 03:22:57,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 3 times [2018-11-10 03:22:57,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:57,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:57,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:22:57,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:58,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash 685642345, now seen corresponding path program 1 times [2018-11-10 03:22:58,002 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:58,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:58,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:22:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:58,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash -110950913, now seen corresponding path program 1 times [2018-11-10 03:22:58,018 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:58,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:22:58,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:58,174 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-10 03:22:58,318 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-11-10 03:22:58,486 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2018-11-10 03:22:58,557 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:22:58,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:22:58,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:22:58,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:22:58,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:22:58,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:22:58,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:22:58,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:22:58,559 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-10 03:22:58,559 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:22:58,559 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:22:58,575 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 03:22:58,578 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 03:22:58,581 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 03:22:58,584 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 03:22:58,586 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 03:22:58,809 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-11-10 03:22:58,934 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-11-10 03:22:58,934 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 03:22:58,935 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 03:22:58,936 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 03:22:58,937 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 03:22:58,940 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 03:22:58,941 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 03:22:58,942 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 03:22:58,943 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 03:22:58,946 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 03:22:58,947 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 03:22:58,948 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 03:22:58,949 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 03:22:58,950 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 03:22:59,320 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:22:59,324 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:22:59,325 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 03:22:59,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:22:59,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:22:59,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:22:59,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:22:59,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:22:59,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:22:59,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:22:59,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:22:59,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:22:59,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:22:59,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:22:59,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:22:59,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:22:59,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:22:59,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:22:59,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:22:59,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:22:59,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:22:59,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:22:59,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:22:59,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:22:59,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:22:59,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:22:59,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:22:59,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:22:59,340 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 03:22:59,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:22:59,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:22:59,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:22:59,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:22:59,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:22:59,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:22:59,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:22:59,342 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:22:59,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:22:59,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:22:59,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:22:59,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:22:59,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:22:59,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:22:59,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:22:59,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:22:59,349 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 03:22:59,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:22:59,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:22:59,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:22:59,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:22:59,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:22:59,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:22:59,369 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:22:59,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:22:59,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:22:59,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:22:59,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:22:59,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:22:59,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:22:59,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:22:59,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:22:59,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:22:59,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:22:59,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:22:59,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:22:59,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:22:59,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:22:59,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:22:59,408 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:22:59,427 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:22:59,427 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 03:22:59,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:22:59,430 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:22:59,430 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:22:59,431 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~sc1~0.base)_1 Supporting invariants [] [2018-11-10 03:22:59,472 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 03:22:59,478 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:22:59,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:22:59,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:22:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:22:59,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:22:59,529 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 03:22:59,531 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:22:59,532 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 03:22:59,560 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 40 states and 47 transitions. Complement of second has 6 states. [2018-11-10 03:22:59,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:22:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:22:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-10 03:22:59,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 15 letters. [2018-11-10 03:22:59,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:22:59,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 23 letters. Loop has 15 letters. [2018-11-10 03:22:59,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:22:59,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 8 letters. Loop has 30 letters. [2018-11-10 03:22:59,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:22:59,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2018-11-10 03:22:59,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 03:22:59,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 44 transitions. [2018-11-10 03:22:59,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 03:22:59,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 03:22:59,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2018-11-10 03:22:59,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:22:59,566 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-10 03:22:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2018-11-10 03:22:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 03:22:59,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 03:22:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-10 03:22:59,568 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 03:22:59,568 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-10 03:22:59,568 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:22:59,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-11-10 03:22:59,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:22:59,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:22:59,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:22:59,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:59,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:22:59,569 INFO L793 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 371#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 341#L558 assume !(main_~length1~0 < 1); 342#L558-2 assume !(main_~length2~0 < 1); 357#L561-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 362#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 363#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 355#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 356#L545-5 assume true; 366#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 367#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 347#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 348#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 353#L548-9 [2018-11-10 03:22:59,569 INFO L795 eck$LassoCheckResult]: Loop: 353#L548-9 assume true; 343#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 344#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 351#L548-3 assume !cstrspn_#t~short7; 359#L548-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 353#L548-9 [2018-11-10 03:22:59,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:59,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-11-10 03:22:59,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:59,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:59,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:22:59,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:59,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-11-10 03:22:59,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:59,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:59,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:22:59,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:22:59,599 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 03:22:59,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:22:59,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 03:22:59,600 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:22:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:22:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:22:59,600 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 03:22:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:22:59,609 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-10 03:22:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:22:59,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 42 transitions. [2018-11-10 03:22:59,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:22:59,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 35 states and 40 transitions. [2018-11-10 03:22:59,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 03:22:59,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 03:22:59,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-11-10 03:22:59,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:22:59,611 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 03:22:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-11-10 03:22:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 03:22:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 03:22:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-10 03:22:59,613 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 03:22:59,613 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-10 03:22:59,613 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:22:59,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2018-11-10 03:22:59,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:22:59,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:22:59,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:22:59,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:59,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:22:59,615 INFO L793 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 449#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 420#L558 assume !(main_~length1~0 < 1); 421#L558-2 assume !(main_~length2~0 < 1); 436#L561-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 439#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 440#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 434#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 435#L545-5 assume true; 441#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 442#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 422#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 423#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 430#L548-9 [2018-11-10 03:22:59,615 INFO L795 eck$LassoCheckResult]: Loop: 430#L548-9 assume true; 426#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 427#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 432#L548-3 assume cstrspn_#t~short7; 437#L548-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-4 445#L548-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 447#L548-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 430#L548-9 [2018-11-10 03:22:59,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-11-10 03:22:59,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:59,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:59,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:22:59,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:59,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:59,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-11-10 03:22:59,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:59,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:59,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:22:59,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:59,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:22:59,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-11-10 03:22:59,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:22:59,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:22:59,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:22:59,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:22:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:22:59,978 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2018-11-10 03:23:00,060 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:23:00,060 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:23:00,060 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:23:00,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:23:00,061 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:23:00,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:23:00,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:23:00,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:23:00,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-10 03:23:00,061 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:23:00,061 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:23:00,065 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 03:23:00,070 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 03:23:00,072 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 03:23:00,073 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 03:23:00,075 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 03:23:00,076 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 03:23:00,077 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 03:23:00,078 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 03:23:00,079 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 03:23:00,082 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 03:23:00,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 03:23:00,086 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 03:23:00,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 03:23:00,089 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 03:23:00,340 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 102 [2018-11-10 03:23:00,435 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 03:23:00,436 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 03:23:00,437 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 03:23:00,438 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 03:23:00,916 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:23:00,916 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:23:00,916 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 03:23:00,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,919 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 03:23:00,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,921 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 03:23:00,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,928 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 03:23:00,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:00,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:00,931 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,931 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 03:23:00,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,934 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 03:23:00,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,936 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 03:23:00,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,938 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 03:23:00,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,939 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,940 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 03:23:00,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,941 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 03:23:00,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:00,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:00,943 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,944 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 03:23:00,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,946 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 03:23:00,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,947 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 03:23:00,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:00,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:00,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:00,949 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,949 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 03:23:00,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:00,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:00,953 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,953 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 03:23:00,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:00,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:00,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,956 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 03:23:00,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:00,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:00,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,960 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 03:23:00,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:00,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:00,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,964 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 03:23:00,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:00,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:00,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:23:00,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:00,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:00,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:00,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:00,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:00,972 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 03:23:00,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:00,973 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:23:00,973 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 03:23:00,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:00,991 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-10 03:23:00,991 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-10 03:23:01,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:01,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:23:01,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:01,050 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:23:01,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:01,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:01,051 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:23:01,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:01,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:01,055 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 03:23:01,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:01,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:01,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:01,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:01,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:01,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:01,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:01,059 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 03:23:01,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:01,060 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:23:01,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:01,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:01,061 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:23:01,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:01,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:01,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:23:01,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:01,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:01,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:01,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:01,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:01,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:01,068 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:01,068 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 03:23:01,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:01,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:01,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:01,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:01,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:01,072 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:01,088 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:23:01,110 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 03:23:01,110 INFO L444 ModelExtractionUtils]: 58 out of 64 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 03:23:01,110 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:23:01,111 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:23:01,111 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:23:01,111 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_2 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-10 03:23:01,162 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2018-11-10 03:23:01,163 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:23:01,164 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:23:01,164 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 03:23:01,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:01,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:01,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:23:01,230 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:23:01,230 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7 Second operand 7 states. [2018-11-10 03:23:01,312 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 40 transitions. cyclomatic complexity: 7. Second operand 7 states. Result 86 states and 94 transitions. Complement of second has 10 states. [2018-11-10 03:23:01,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:23:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:23:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 03:23:01,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 03:23:01,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:01,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 03:23:01,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:01,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 03:23:01,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:01,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 94 transitions. [2018-11-10 03:23:01,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:23:01,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 60 states and 66 transitions. [2018-11-10 03:23:01,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 03:23:01,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 03:23:01,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 66 transitions. [2018-11-10 03:23:01,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:23:01,318 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-11-10 03:23:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 66 transitions. [2018-11-10 03:23:01,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-11-10 03:23:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 03:23:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-10 03:23:01,321 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 03:23:01,321 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 03:23:01,321 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:23:01,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-11-10 03:23:01,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:23:01,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:23:01,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:23:01,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:23:01,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:23:01,326 INFO L793 eck$LassoCheckResult]: Stem: 740#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 739#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 708#L558 assume !(main_~length1~0 < 1); 709#L558-2 assume !(main_~length2~0 < 1); 725#L561-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~malloc12.base, main_#t~malloc12.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~malloc12.base, main_#t~malloc12.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~malloc13.base, main_#t~malloc13.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~malloc13.base, main_#t~malloc13.offset; 728#L566 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1, 1); srcloc: L566 729#L566-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1, 1); srcloc: L566-1 723#L567 assume { :begin_inline_cstrspn } true;cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 724#L545-5 assume true; 745#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 738#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 716#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 717#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 722#L548-9 assume true; 712#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 713#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 756#L548-3 assume cstrspn_#t~short7; 754#L548-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-4 752#L548-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 741#L548-7 assume !cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5; 742#L548-10 SUMMARY for call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-10 746#L550 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 743#L545-4 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, cstrspn_#t~post2.offset + 1;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 744#L545-5 assume true; 732#L545-1 SUMMARY for call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L545-1 733#L545-2 assume !!(cstrspn_#t~mem3 != 0);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 714#L547 SUMMARY for call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); srcloc: L547 715#L547-1 cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 721#L548-9 [2018-11-10 03:23:01,327 INFO L795 eck$LassoCheckResult]: Loop: 721#L548-9 assume true; 710#L548-1 SUMMARY for call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-1 711#L548-2 cstrspn_#t~short7 := cstrspn_#t~mem5 != 0; 718#L548-3 assume cstrspn_#t~short7; 726#L548-4 SUMMARY for call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); srcloc: L548-4 730#L548-5 cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 736#L548-7 assume !!cstrspn_#t~short7;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, cstrspn_#t~post8.offset + 1;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 721#L548-9 [2018-11-10 03:23:01,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:01,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 2 times [2018-11-10 03:23:01,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:23:01,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:23:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:01,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:23:01,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:01,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:01,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-11-10 03:23:01,350 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:23:01,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:23:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:01,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:23:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:01,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:01,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-11-10 03:23:01,356 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:23:01,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:23:01,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:01,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:23:01,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:23:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:23:01,932 WARN L179 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 149 [2018-11-10 03:23:02,675 WARN L179 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 119 [2018-11-10 03:23:02,677 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:23:02,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:23:02,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:23:02,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:23:02,677 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:23:02,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:23:02,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:23:02,677 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:23:02,677 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-10 03:23:02,677 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:23:02,677 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:23:02,682 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 03:23:02,686 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 03:23:02,690 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 03:23:02,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:02,692 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 03:23:02,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:02,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:02,696 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 03:23:02,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:02,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:23:02,706 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 03:23:02,707 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 03:23:02,707 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 03:23:02,708 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 03:23:02,709 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 03:23:02,713 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 03:23:02,714 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 03:23:02,846 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 03:23:03,453 WARN L179 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 119 [2018-11-10 03:23:03,565 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 03:23:04,130 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-11-10 03:23:04,221 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:23:04,221 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:23:04,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:23:04,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,224 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,224 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 03:23:04,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,233 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 03:23:04,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,235 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 03:23:04,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,237 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 03:23:04,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,238 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 03:23:04,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:23:04,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,241 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 03:23:04,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,244 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 03:23:04,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:23:04,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,247 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 03:23:04,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:23:04,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,250 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 03:23:04,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,251 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 03:23:04,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,253 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 03:23:04,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,255 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 03:23:04,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:23:04,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:23:04,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:23:04,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:23:04,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,259 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 03:23:04,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,261 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,261 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 03:23:04,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,262 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 03:23:04,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,263 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 03:23:04,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,268 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 03:23:04,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,271 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 03:23:04,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,274 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 03:23:04,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,277 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 03:23:04,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,281 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 03:23:04,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:23:04,284 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 03:23:04,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:23:04,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:23:04,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:23:04,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:23:04,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:23:04,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:23:04,312 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:23:04,323 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 03:23:04,323 INFO L444 ModelExtractionUtils]: 66 out of 70 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:23:04,324 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:23:04,324 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 03:23:04,325 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:23:04,325 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_3 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2018-11-10 03:23:04,444 INFO L297 tatePredicateManager]: 27 out of 28 supporting invariants were superfluous and have been removed [2018-11-10 03:23:04,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 03:23:04,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 03:23:04,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-10 03:23:04,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:04,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:04,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:04,514 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 03:23:04,514 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:23:04,515 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 03:23:04,567 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-11-10 03:23:04,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:23:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:23:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 03:23:04,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 03:23:04,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:04,569 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:23:04,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:04,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:04,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:04,638 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 03:23:04,638 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:23:04,638 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 03:23:04,685 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 80 states and 86 transitions. Complement of second has 10 states. [2018-11-10 03:23:04,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:23:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:23:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-10 03:23:04,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 03:23:04,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:04,687 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:23:04,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:23:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:04,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:23:04,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:23:04,751 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 03:23:04,752 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-11-10 03:23:04,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 03:23:04,800 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 85 states and 92 transitions. Complement of second has 9 states. [2018-11-10 03:23:04,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:23:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 03:23:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-10 03:23:04,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 03:23:04,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:04,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 03:23:04,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:04,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 43 transitions. Stem has 28 letters. Loop has 14 letters. [2018-11-10 03:23:04,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:23:04,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 92 transitions. [2018-11-10 03:23:04,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:23:04,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 0 states and 0 transitions. [2018-11-10 03:23:04,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:23:04,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:23:04,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:23:04,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:23:04,805 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:23:04,805 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:23:04,805 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:23:04,805 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:23:04,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:23:04,805 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:23:04,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:23:04,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:23:04 BoogieIcfgContainer [2018-11-10 03:23:04,810 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:23:04,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:23:04,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:23:04,810 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:23:04,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:22:57" (3/4) ... [2018-11-10 03:23:04,813 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:23:04,813 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:23:04,814 INFO L168 Benchmark]: Toolchain (without parser) took 8096.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 398.5 MB). Free memory was 956.5 MB in the beginning and 993.2 MB in the end (delta: -36.8 MB). Peak memory consumption was 361.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:23:04,814 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:23:04,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.15 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 03:23:04,815 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -211.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:23:04,815 INFO L168 Benchmark]: Boogie Preprocessor took 22.58 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 03:23:04,816 INFO L168 Benchmark]: RCFGBuilder took 238.86 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:23:04,816 INFO L168 Benchmark]: BuchiAutomizer took 7492.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 131.1 MB). Peak memory consumption was 377.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:23:04,816 INFO L168 Benchmark]: Witness Printer took 3.10 ms. Allocated memory is still 1.4 GB. Free memory is still 993.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:23:04,819 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.15 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 73.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 935.0 MB in the beginning and 1.1 GB in the end (delta: -211.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.58 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 238.86 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: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7492.62 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 131.1 MB). Peak memory consumption was 377.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.10 ms. Allocated memory is still 1.4 GB. Free memory is still 993.2 MB. There was no memory consumed. 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 - 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[#Ultimate.alloc_#res] + -1 * s and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 190 SDtfs, 238 SDslu, 225 SDs, 0 SdLazy, 213 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax100 hnf99 lsp91 ukn87 mio100 lsp30 div122 bol100 ite100 ukn100 eq173 hnf83 smp95 dnf525 smp25 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 76ms VariablesStem: 2 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 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...