./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:24:38,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:24:38,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:24:38,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:24:38,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:24:38,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:24:38,359 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:24:38,360 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:24:38,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:24:38,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:24:38,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:24:38,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:24:38,363 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:24:38,363 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:24:38,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:24:38,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:24:38,365 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:24:38,366 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:24:38,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:24:38,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:24:38,369 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:24:38,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:24:38,371 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:24:38,372 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:24:38,372 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:24:38,372 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:24:38,373 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:24:38,374 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:24:38,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:24:38,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:24:38,375 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:24:38,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:24:38,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:24:38,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:24:38,376 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:24:38,377 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:24:38,377 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 02:24:38,387 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:24:38,387 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:24:38,388 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:24:38,388 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:24:38,389 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:24:38,389 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:24:38,389 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:24:38,389 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:24:38,389 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:24:38,389 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:24:38,390 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:24:38,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:24:38,390 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:24:38,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:24:38,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:24:38,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:24:38,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:24:38,391 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:24:38,391 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:24:38,391 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:24:38,391 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:24:38,391 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:24:38,391 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:24:38,391 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:24:38,392 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:24:38,392 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:24:38,392 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:24:38,392 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:24:38,393 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_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e6bf2d6e706b2fafcc380eb0a4d60b5a7a1666b [2018-11-10 02:24:38,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:24:38,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:24:38,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:24:38,430 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:24:38,430 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:24:38,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2018-11-10 02:24:38,475 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/data/d1b00f087/35d281ec01a347cab4c2ad41724c2abc/FLAGd8c23dc0b [2018-11-10 02:24:38,907 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:24:38,908 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/sv-benchmarks/c/termination-15/cstrcspn_reverse_alloca_true-termination.c.i [2018-11-10 02:24:38,914 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/data/d1b00f087/35d281ec01a347cab4c2ad41724c2abc/FLAGd8c23dc0b [2018-11-10 02:24:38,924 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/data/d1b00f087/35d281ec01a347cab4c2ad41724c2abc [2018-11-10 02:24:38,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:24:38,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:24:38,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:24:38,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:24:38,930 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:24:38,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:24:38" (1/1) ... [2018-11-10 02:24:38,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4943cf3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:38, skipping insertion in model container [2018-11-10 02:24:38,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:24:38" (1/1) ... [2018-11-10 02:24:38,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:24:38,963 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:24:39,161 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:24:39,168 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:24:39,201 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:24:39,239 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:24:39,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39 WrapperNode [2018-11-10 02:24:39,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:24:39,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:24:39,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:24:39,241 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:24:39,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... [2018-11-10 02:24:39,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... [2018-11-10 02:24:39,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:24:39,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:24:39,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:24:39,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:24:39,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... [2018-11-10 02:24:39,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... [2018-11-10 02:24:39,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... [2018-11-10 02:24:39,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... [2018-11-10 02:24:39,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... [2018-11-10 02:24:39,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... [2018-11-10 02:24:39,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... [2018-11-10 02:24:39,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:24:39,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:24:39,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:24:39,338 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:24:39,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/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 02:24:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 02:24:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 02:24:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:24:39,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:24:39,561 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:24:39,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:24:39 BoogieIcfgContainer [2018-11-10 02:24:39,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:24:39,562 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:24:39,562 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:24:39,564 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:24:39,565 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:24:39,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:24:38" (1/3) ... [2018-11-10 02:24:39,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9b76610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:24:39, skipping insertion in model container [2018-11-10 02:24:39,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:24:39,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:39" (2/3) ... [2018-11-10 02:24:39,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9b76610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:24:39, skipping insertion in model container [2018-11-10 02:24:39,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:24:39,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:24:39" (3/3) ... [2018-11-10 02:24:39,568 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcspn_reverse_alloca_true-termination.c.i [2018-11-10 02:24:39,601 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:24:39,601 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:24:39,601 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:24:39,601 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:24:39,601 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:24:39,602 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:24:39,602 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:24:39,602 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:24:39,602 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:24:39,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 02:24:39,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 02:24:39,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:39,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:39,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:39,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:39,633 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:24:39,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 02:24:39,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 02:24:39,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:39,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:39,636 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:39,636 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:39,642 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 10#L382true assume !(main_~length1~0 < 1); 14#L382-2true assume !(main_~length2~0 < 1); 7#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 27#L390true SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 29#L390-1true SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 13#L391true main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 4#L369-5true [2018-11-10 02:24:39,642 INFO L795 eck$LassoCheckResult]: Loop: 4#L369-5true assume true; 16#L369-1true SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 18#L369-2true assume !!(cstrcspn_#t~mem206 != 0);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 11#L371true SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 12#L371-1true cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 21#L372-9true assume !true; 22#L372-10true SUMMARY for call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-10 5#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 3#L369-4true cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 4#L369-5true [2018-11-10 02:24:39,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 1 times [2018-11-10 02:24:39,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:39,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash 63979231, now seen corresponding path program 1 times [2018-11-10 02:24:39,747 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:39,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:39,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:39,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:39,770 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 02:24:39,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:39,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:24:39,775 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:24:39,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 02:24:39,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 02:24:39,786 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 02:24:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:39,791 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2018-11-10 02:24:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 02:24:39,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2018-11-10 02:24:39,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 02:24:39,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 23 states and 27 transitions. [2018-11-10 02:24:39,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 02:24:39,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 02:24:39,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2018-11-10 02:24:39,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:24:39,797 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 02:24:39,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2018-11-10 02:24:39,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 02:24:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 02:24:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-10 02:24:39,820 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 02:24:39,820 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-10 02:24:39,821 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:24:39,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-10 02:24:39,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 02:24:39,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:39,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:39,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:39,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:39,822 INFO L793 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 75#L382 assume !(main_~length1~0 < 1); 76#L382-2 assume !(main_~length2~0 < 1); 72#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 73#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 84#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 82#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 68#L369-5 [2018-11-10 02:24:39,823 INFO L795 eck$LassoCheckResult]: Loop: 68#L369-5 assume true; 69#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 85#L369-2 assume !!(cstrcspn_#t~mem206 != 0);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 78#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 79#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 66#L372-9 assume true; 71#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 80#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 0; 81#L372-3 assume !cstrcspn_#t~short210; 64#L372-7 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 65#L372-10 SUMMARY for call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-10 70#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 67#L369-4 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 68#L369-5 [2018-11-10 02:24:39,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:39,823 INFO L82 PathProgramCache]: Analyzing trace with hash 180425515, now seen corresponding path program 2 times [2018-11-10 02:24:39,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:39,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:39,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -446768180, now seen corresponding path program 1 times [2018-11-10 02:24:39,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:39,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1600668446, now seen corresponding path program 1 times [2018-11-10 02:24:39,872 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:39,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:39,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:39,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:40,048 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2018-11-10 02:24:40,319 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-10 02:24:40,418 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:24:40,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:24:40,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:24:40,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:24:40,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:24:40,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:40,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:24:40,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:24:40,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 02:24:40,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:24:40,420 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:24:40,441 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 02:24:40,445 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 02:24:40,447 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 02:24:40,449 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 02:24:40,450 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 02:24:40,665 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2018-11-10 02:24:40,776 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 02:24:40,778 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 02:24:40,780 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 02:24:40,781 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 02:24:40,782 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 02:24:40,783 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 02:24:40,784 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 02:24:40,785 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 02:24:40,786 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 02:24:40,788 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 02:24:40,789 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 02:24:40,791 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 02:24:40,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:41,144 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:24:41,147 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:24:41,149 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 02:24:41,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:41,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:41,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:41,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:41,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:41,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:41,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:41,153 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:41,153 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 02:24:41,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:41,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:41,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:41,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:41,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:41,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:41,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:41,159 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 02:24:41,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:41,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:41,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:41,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:41,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:41,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:41,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:41,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:41,162 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 02:24:41,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:41,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:41,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:41,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:41,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:41,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:41,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:41,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:41,165 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 02:24:41,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:41,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:41,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:41,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:41,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:41,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:41,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:41,172 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 02:24:41,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:41,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:41,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:41,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:41,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:41,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:41,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:41,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:41,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:41,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:41,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:41,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:41,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:41,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:41,260 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:24:41,302 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 02:24:41,302 INFO L444 ModelExtractionUtils]: 56 out of 64 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 02:24:41,304 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:24:41,305 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:24:41,306 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:24:41,306 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1, ULTIMATE.start_cstrcspn_~sc1~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc215.base)_1 + 2*ULTIMATE.start_cstrcspn_~sc1~0.offset Supporting invariants [] [2018-11-10 02:24:41,349 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-10 02:24:41,354 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 02:24:41,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:41,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:41,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:41,434 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 02:24:41,437 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-10 02:24:41,437 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-10 02:24:41,503 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 27 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 38 states and 45 transitions. Complement of second has 7 states. [2018-11-10 02:24:41,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:24:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 02:24:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-10 02:24:41,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 13 letters. [2018-11-10 02:24:41,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:41,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 21 letters. Loop has 13 letters. [2018-11-10 02:24:41,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:41,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 8 letters. Loop has 26 letters. [2018-11-10 02:24:41,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:41,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 45 transitions. [2018-11-10 02:24:41,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:24:41,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 35 states and 42 transitions. [2018-11-10 02:24:41,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 02:24:41,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 02:24:41,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2018-11-10 02:24:41,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:24:41,509 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 02:24:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2018-11-10 02:24:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 02:24:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 02:24:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-11-10 02:24:41,511 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 02:24:41,511 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-11-10 02:24:41,511 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:24:41,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2018-11-10 02:24:41,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:24:41,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:41,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:41,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:41,512 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:24:41,512 INFO L793 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 271#L382 assume !(main_~length1~0 < 1); 272#L382-2 assume !(main_~length2~0 < 1); 268#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 269#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 285#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 282#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 262#L369-5 assume true; 264#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 286#L369-2 assume !!(cstrcspn_#t~mem206 != 0);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 274#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 275#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 256#L372-9 [2018-11-10 02:24:41,513 INFO L795 eck$LassoCheckResult]: Loop: 256#L372-9 assume true; 266#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 278#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 0; 280#L372-3 assume !cstrcspn_#t~short210; 255#L372-7 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 256#L372-9 [2018-11-10 02:24:41,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:41,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 1 times [2018-11-10 02:24:41,513 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:41,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:41,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash 61138312, now seen corresponding path program 1 times [2018-11-10 02:24:41,533 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:41,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:41,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:41,543 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 02:24:41,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:41,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:24:41,544 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:24:41,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:24:41,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:24:41,544 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-10 02:24:41,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:41,550 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-11-10 02:24:41,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:24:41,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2018-11-10 02:24:41,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:24:41,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 42 transitions. [2018-11-10 02:24:41,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-10 02:24:41,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 02:24:41,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 42 transitions. [2018-11-10 02:24:41,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:24:41,552 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 02:24:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 42 transitions. [2018-11-10 02:24:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-10 02:24:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 02:24:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-11-10 02:24:41,554 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 02:24:41,555 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-11-10 02:24:41,555 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:24:41,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2018-11-10 02:24:41,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:24:41,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:41,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:41,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:41,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:41,556 INFO L793 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 348#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 349#L382 assume !(main_~length1~0 < 1); 350#L382-2 assume !(main_~length2~0 < 1); 346#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 347#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 363#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 360#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 339#L369-5 assume true; 341#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 366#L369-2 assume !!(cstrcspn_#t~mem206 != 0);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 352#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 353#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 334#L372-9 [2018-11-10 02:24:41,556 INFO L795 eck$LassoCheckResult]: Loop: 334#L372-9 assume true; 343#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 356#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 0; 358#L372-3 assume cstrcspn_#t~short210; 361#L372-4 SUMMARY for call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-4 364#L372-5 cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 333#L372-7 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 334#L372-9 [2018-11-10 02:24:41,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:41,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1016337937, now seen corresponding path program 2 times [2018-11-10 02:24:41,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:41,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:41,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 1 times [2018-11-10 02:24:41,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:41,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:41,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1160139397, now seen corresponding path program 1 times [2018-11-10 02:24:41,580 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:41,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,977 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 117 [2018-11-10 02:24:42,067 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:24:42,068 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:24:42,068 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:24:42,068 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:24:42,068 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:24:42,068 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:42,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:24:42,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:24:42,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 02:24:42,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:24:42,068 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:24:42,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 02:24:42,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 02:24:42,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 02:24:42,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 02:24:42,080 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 02:24:42,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:42,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:42,084 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 02:24:42,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 02:24:42,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 02:24:42,349 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 106 [2018-11-10 02:24:42,464 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-10 02:24:42,465 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 02:24:42,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:42,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:42,473 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 02:24:42,474 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 02:24:42,475 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 02:24:42,476 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 02:24:42,477 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 02:24:42,689 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-11-10 02:24:42,990 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:24:42,990 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:24:42,991 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 02:24:42,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:42,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:42,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:42,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:42,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:42,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:42,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:42,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:42,993 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 02:24:42,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:42,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:42,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:42,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:42,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:42,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:42,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:42,994 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:42,994 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 02:24:42,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:42,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:42,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:42,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:43,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,003 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 02:24:43,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:43,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:43,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:43,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,005 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 02:24:43,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:43,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:43,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:43,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,007 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 02:24:43,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:43,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:43,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:43,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,009 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 02:24:43,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:43,010 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,012 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 02:24:43,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:43,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:43,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:43,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,014 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 02:24:43,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:43,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:43,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:43,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,016 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 02:24:43,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:43,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,019 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 02:24:43,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:43,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,026 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 02:24:43,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,027 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:24:43,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,029 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:43,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,037 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 02:24:43,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:43,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,040 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 02:24:43,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,041 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:24:43,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,042 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:43,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,051 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 02:24:43,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:43,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,054 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 02:24:43,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:43,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,057 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,057 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 02:24:43,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,058 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:24:43,058 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 02:24:43,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,075 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-10 02:24:43,075 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-10 02:24:43,133 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:43,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:43,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:43,137 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 02:24:43,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:43,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:43,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:43,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:43,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:43,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:43,155 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:24:43,167 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 02:24:43,167 INFO L444 ModelExtractionUtils]: 61 out of 67 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:24:43,167 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:24:43,168 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 02:24:43,168 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:24:43,168 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_#Ultimate.alloc_~size, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*ULTIMATE.start_#Ultimate.alloc_~size + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [1*ULTIMATE.start_#Ultimate.alloc_~size - 1 >= 0] [2018-11-10 02:24:43,238 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 02:24:43,240 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~size [2018-11-10 02:24:43,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:43,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:43,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:43,302 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 02:24:43,302 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 02:24:43,302 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-10 02:24:43,345 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 42 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 89 states and 100 transitions. Complement of second has 9 states. [2018-11-10 02:24:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:24:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 02:24:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-10 02:24:43,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 13 letters. Loop has 7 letters. [2018-11-10 02:24:43,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:43,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 20 letters. Loop has 7 letters. [2018-11-10 02:24:43,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:43,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 13 letters. Loop has 14 letters. [2018-11-10 02:24:43,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:43,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 100 transitions. [2018-11-10 02:24:43,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:24:43,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 62 states and 70 transitions. [2018-11-10 02:24:43,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 02:24:43,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 02:24:43,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2018-11-10 02:24:43,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:24:43,349 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-10 02:24:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2018-11-10 02:24:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2018-11-10 02:24:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 02:24:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-10 02:24:43,354 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 02:24:43,354 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-10 02:24:43,354 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:24:43,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 59 transitions. [2018-11-10 02:24:43,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:24:43,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:43,355 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:43,356 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] [2018-11-10 02:24:43,356 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:43,356 INFO L793 eck$LassoCheckResult]: Stem: 652#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 649#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 650#L382 assume !(main_~length1~0 < 1); 651#L382-2 assume !(main_~length2~0 < 1); 647#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 648#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 664#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 661#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 639#L369-5 assume true; 640#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 684#L369-2 assume !!(cstrcspn_#t~mem206 != 0);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 683#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 681#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 671#L372-9 assume true; 679#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 682#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 0; 680#L372-3 assume !cstrcspn_#t~short210; 635#L372-7 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 636#L372-10 SUMMARY for call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-10 643#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 637#L369-4 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 638#L369-5 assume true; 642#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 665#L369-2 assume !!(cstrcspn_#t~mem206 != 0);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 653#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 654#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 634#L372-9 [2018-11-10 02:24:43,356 INFO L795 eck$LassoCheckResult]: Loop: 634#L372-9 assume true; 644#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 657#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 0; 659#L372-3 assume cstrcspn_#t~short210; 662#L372-4 SUMMARY for call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-4 667#L372-5 cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 633#L372-7 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 634#L372-9 [2018-11-10 02:24:43,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2009458362, now seen corresponding path program 2 times [2018-11-10 02:24:43,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:43,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:43,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:43,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 2 times [2018-11-10 02:24:43,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:43,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:43,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:43,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1050967218, now seen corresponding path program 1 times [2018-11-10 02:24:43,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:43,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:43,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:43,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:24:43,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 02:24:43,471 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0c60c216-1ed0-4723-a6ce-cff8d779e191/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 02:24:43,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:43,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:43,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 02:24:43,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:24:43,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:24:43,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:24:43,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 02:24:43,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:11, output treesize:7 [2018-11-10 02:24:43,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 02:24:43,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 02:24:43,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:24:43,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:24:43,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:24:43,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 02:24:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:24:43,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 02:24:43,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2018-11-10 02:24:43,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 02:24:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 02:24:43,777 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. cyclomatic complexity: 10 Second operand 15 states. [2018-11-10 02:24:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:44,077 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-10 02:24:44,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 02:24:44,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 121 transitions. [2018-11-10 02:24:44,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:24:44,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 88 states and 98 transitions. [2018-11-10 02:24:44,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 02:24:44,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 02:24:44,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 98 transitions. [2018-11-10 02:24:44,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:24:44,081 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-11-10 02:24:44,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 98 transitions. [2018-11-10 02:24:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2018-11-10 02:24:44,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 02:24:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-11-10 02:24:44,086 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-10 02:24:44,086 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-11-10 02:24:44,087 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:24:44,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 68 transitions. [2018-11-10 02:24:44,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:24:44,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:44,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:44,088 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 02:24:44,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:44,088 INFO L793 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 948#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217, 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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 949#L382 assume !(main_~length1~0 < 1); 950#L382-2 assume !(main_~length2~0 < 1); 945#L385-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~malloc215.base, main_#t~malloc215.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~malloc215.base, main_#t~malloc215.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~malloc216.base, main_#t~malloc216.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~malloc216.base, main_#t~malloc216.offset; 946#L390 SUMMARY for call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + 0, 1); srcloc: L390 964#L390-1 SUMMARY for call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + 0, 1); srcloc: L390-1 961#L391 main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1) * 1;main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1) * 1;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset, cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrcspn_#res;havoc cstrcspn_#t~mem207, cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset, cstrcspn_#t~mem208, cstrcspn_#t~mem209, cstrcspn_#t~short210, cstrcspn_#t~mem212, cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset, cstrcspn_#t~mem206, cstrcspn_~s1.base, cstrcspn_~s1.offset, cstrcspn_~s2.base, cstrcspn_~s2.offset, cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, cstrcspn_~s~0.base, cstrcspn_~s~0.offset, cstrcspn_~c~0;cstrcspn_~s1.base, cstrcspn_~s1.offset := cstrcspn_#in~s1.base, cstrcspn_#in~s1.offset;cstrcspn_~s2.base, cstrcspn_~s2.offset := cstrcspn_#in~s2.base, cstrcspn_#in~s2.offset;havoc cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;havoc cstrcspn_~s~0.base, cstrcspn_~s~0.offset;havoc cstrcspn_~c~0;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_~s1.base, cstrcspn_~s1.offset; 937#L369-5 assume true; 938#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 979#L369-2 assume !!(cstrcspn_#t~mem206 != 0);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 956#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 957#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 978#L372-9 assume true; 989#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 987#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 0; 983#L372-3 assume cstrcspn_#t~short210; 982#L372-4 SUMMARY for call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-4 970#L372-5 cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 971#L372-7 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210; 947#L372-10 SUMMARY for call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-10 941#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 935#L369-4 cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset := cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset;cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset := cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset - 1;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 936#L369-5 assume true; 940#L369-1 SUMMARY for call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L369-1 965#L369-2 assume !!(cstrcspn_#t~mem206 != 0);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset; 954#L371 SUMMARY for call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); srcloc: L371 955#L371-1 cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 932#L372-9 [2018-11-10 02:24:44,088 INFO L795 eck$LassoCheckResult]: Loop: 932#L372-9 assume true; 942#L372-1 SUMMARY for call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-1 951#L372-2 cstrcspn_#t~short210 := cstrcspn_#t~mem208 != 0; 958#L372-3 assume cstrcspn_#t~short210; 962#L372-4 SUMMARY for call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); srcloc: L372-4 967#L372-5 cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 931#L372-7 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~mem209;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~short210;cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset := cstrcspn_~s~0.base, cstrcspn_~s~0.offset;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset - 1;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 932#L372-9 [2018-11-10 02:24:44,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:44,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1457731651, now seen corresponding path program 1 times [2018-11-10 02:24:44,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:44,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:44,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:44,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:44,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:44,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:44,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1375750773, now seen corresponding path program 3 times [2018-11-10 02:24:44,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:44,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:44,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:44,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:44,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:44,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:44,116 INFO L82 PathProgramCache]: Analyzing trace with hash 547488335, now seen corresponding path program 1 times [2018-11-10 02:24:44,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:44,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:44,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:44,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:44,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:44,246 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2018-11-10 02:24:44,748 WARN L179 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 157 [2018-11-10 02:24:45,358 WARN L179 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 122 [2018-11-10 02:24:45,360 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:24:45,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:24:45,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:24:45,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:24:45,360 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:24:45,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:45,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:24:45,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:24:45,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_reverse_alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 02:24:45,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:24:45,361 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:24:45,366 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 02:24:45,375 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 02:24:45,376 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 02:24:45,377 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 02:24:45,378 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 02:24:45,379 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 02:24:45,380 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 02:24:45,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 02:24:46,078 WARN L179 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2018-11-10 02:24:46,172 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 02:24:46,174 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 02:24:46,175 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 02:24:46,176 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 02:24:46,177 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 02:24:46,178 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 02:24:46,179 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 02:24:46,180 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 02:24:46,181 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 02:24:46,182 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 02:24:46,183 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 02:24:46,184 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 02:24:46,865 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2018-11-10 02:24:47,004 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:24:47,004 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:24:47,005 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 02:24:47,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:47,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:47,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:47,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:47,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:47,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:47,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:47,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:47,011 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 02:24:47,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:47,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:47,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:47,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:47,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:47,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:47,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:47,012 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:47,013 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 02:24:47,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:47,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:47,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:47,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:47,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:47,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:47,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:47,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:47,014 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 02:24:47,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:47,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:47,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:47,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:47,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:47,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:47,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:47,016 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 02:24:47,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:47,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:47,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:47,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:47,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:47,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:47,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:47,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:47,017 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 02:24:47,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:47,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:47,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:47,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:47,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:47,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:47,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:47,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:47,018 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 02:24:47,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:47,018 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:24:47,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:47,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:47,019 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:47,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:47,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:47,022 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 02:24:47,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:47,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:47,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:47,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:47,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:47,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:47,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:47,024 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 02:24:47,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:47,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:47,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:47,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:47,027 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:47,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:24:47,041 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:24:47,049 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:24:47,050 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 02:24:47,050 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:24:47,051 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 02:24:47,051 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:24:47,051 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_#Ultimate.alloc_~size, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*ULTIMATE.start_#Ultimate.alloc_~size + 2*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [1*ULTIMATE.start_#Ultimate.alloc_~size - 1 >= 0] [2018-11-10 02:24:47,178 INFO L297 tatePredicateManager]: 29 out of 30 supporting invariants were superfluous and have been removed [2018-11-10 02:24:47,179 WARN L1239 BoogieBacktranslator]: unknown boogie variable ~size [2018-11-10 02:24:47,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:47,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:47,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:47,228 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 02:24:47,228 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 02:24:47,229 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-10 02:24:47,266 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 92 states and 104 transitions. Complement of second has 9 states. [2018-11-10 02:24:47,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:24:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 02:24:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-10 02:24:47,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 02:24:47,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:47,267 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:24:47,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:47,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:47,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:47,325 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 02:24:47,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 02:24:47,325 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-10 02:24:47,360 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 92 states and 104 transitions. Complement of second has 9 states. [2018-11-10 02:24:47,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:24:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 02:24:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-10 02:24:47,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 02:24:47,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:47,361 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:24:47,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:47,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:47,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:24:47,416 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 02:24:47,417 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 02:24:47,417 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-10 02:24:47,455 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 99 states and 114 transitions. Complement of second has 8 states. [2018-11-10 02:24:47,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 02:24:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 02:24:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-10 02:24:47,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 28 letters. Loop has 7 letters. [2018-11-10 02:24:47,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:47,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 02:24:47,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:47,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 28 letters. Loop has 14 letters. [2018-11-10 02:24:47,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:24:47,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 114 transitions. [2018-11-10 02:24:47,463 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:24:47,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 0 states and 0 transitions. [2018-11-10 02:24:47,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:24:47,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:24:47,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:24:47,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:24:47,464 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:24:47,464 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:24:47,464 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:24:47,464 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:24:47,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:24:47,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:24:47,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:24:47,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:24:47 BoogieIcfgContainer [2018-11-10 02:24:47,468 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:24:47,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:24:47,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:24:47,469 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:24:47,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:24:39" (3/4) ... [2018-11-10 02:24:47,472 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:24:47,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:24:47,473 INFO L168 Benchmark]: Toolchain (without parser) took 8545.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.8 MB). Free memory was 952.2 MB in the beginning and 1.4 GB in the end (delta: -422.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:24:47,473 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:24:47,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.13 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 924.1 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:47,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 924.1 MB in the beginning and 1.2 GB in the end (delta: -226.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:47,474 INFO L168 Benchmark]: Boogie Preprocessor took 23.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:47,475 INFO L168 Benchmark]: RCFGBuilder took 223.10 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:47,476 INFO L168 Benchmark]: BuchiAutomizer took 7906.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -254.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:24:47,476 INFO L168 Benchmark]: Witness Printer took 3.56 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:24:47,479 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.13 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 924.1 MB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 924.1 MB in the beginning and 1.2 GB in the end (delta: -226.1 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 223.10 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: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7906.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -254.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.56 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable ~size - GenericResult: Unfinished Backtranslation unknown boogie variable ~size * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length1 * sizeof(char))] + 2 * sc1 and consists of 5 locations. One deterministic module has affine ranking function unknown-~size-unknown + 2 * s and consists of 6 locations. One nondeterministic module has affine ranking function unknown-~size-unknown + 2 * s and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 60 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 204 SDtfs, 368 SDslu, 261 SDs, 0 SdLazy, 222 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital357 mio100 ax100 hnf99 lsp91 ukn94 mio100 lsp40 div115 bol100 ite100 ukn100 eq184 hnf82 smp89 dnf675 smp50 tf100 neg96 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 75ms 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...