./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrcspn_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrcspn_malloc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/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 9b8825911d7551a36ae924528ba18cf2d7bccc78 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:07:50,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:07:50,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:07:50,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:07:50,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:07:50,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:07:50,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:07:50,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:07:50,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:07:50,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:07:50,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:07:50,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:07:50,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:07:50,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:07:50,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:07:50,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:07:50,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:07:50,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:07:50,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:07:50,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:07:50,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:07:50,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:07:50,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:07:50,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:07:50,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:07:50,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:07:50,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:07:50,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:07:50,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:07:50,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:07:50,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:07:50,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:07:50,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:07:50,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:07:50,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:07:50,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:07:50,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:07:50,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:07:50,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:07:50,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:07:50,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:07:50,551 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:07:50,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:07:50,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:07:50,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:07:50,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:07:50,568 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:07:50,569 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:07:50,569 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:07:50,569 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:07:50,569 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:07:50,569 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:07:50,570 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:07:50,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:07:50,570 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:07:50,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:07:50,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:07:50,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:07:50,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:07:50,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:07:50,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:07:50,571 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:07:50,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:07:50,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:07:50,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:07:50,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:07:50,573 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:07:50,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:07:50,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:07:50,573 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:07:50,574 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:07:50,574 INFO L138 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/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/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 -> 9b8825911d7551a36ae924528ba18cf2d7bccc78 [2019-11-15 21:07:50,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:07:50,608 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:07:50,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:07:50,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:07:50,613 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:07:50,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2019-11-15 21:07:50,662 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/data/7294674ad/577bb6ec07014d968f14f46cba693994/FLAGb22c20b4f [2019-11-15 21:07:51,183 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:07:51,184 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/sv-benchmarks/c/termination-15/cstrcspn_malloc.i [2019-11-15 21:07:51,196 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/data/7294674ad/577bb6ec07014d968f14f46cba693994/FLAGb22c20b4f [2019-11-15 21:07:51,685 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/data/7294674ad/577bb6ec07014d968f14f46cba693994 [2019-11-15 21:07:51,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:07:51,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:07:51,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:07:51,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:07:51,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:07:51,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:07:51" (1/1) ... [2019-11-15 21:07:51,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afdec8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:51, skipping insertion in model container [2019-11-15 21:07:51,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:07:51" (1/1) ... [2019-11-15 21:07:51,708 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:07:51,761 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:07:52,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:07:52,167 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:07:52,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:07:52,315 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:07:52,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52 WrapperNode [2019-11-15 21:07:52,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:07:52,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:07:52,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:07:52,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:07:52,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... [2019-11-15 21:07:52,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... [2019-11-15 21:07:52,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:07:52,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:07:52,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:07:52,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:07:52,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... [2019-11-15 21:07:52,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... [2019-11-15 21:07:52,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... [2019-11-15 21:07:52,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... [2019-11-15 21:07:52,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... [2019-11-15 21:07:52,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... [2019-11-15 21:07:52,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... [2019-11-15 21:07:52,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:07:52,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:07:52,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:07:52,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:07:52,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/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 [2019-11-15 21:07:52,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:07:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:07:52,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:07:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:07:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:07:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:07:52,870 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:07:52,870 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:07:52,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:07:52 BoogieIcfgContainer [2019-11-15 21:07:52,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:07:52,872 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:07:52,872 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:07:52,878 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:07:52,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:07:52,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:07:51" (1/3) ... [2019-11-15 21:07:52,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c6a29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:07:52, skipping insertion in model container [2019-11-15 21:07:52,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:07:52,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:07:52" (2/3) ... [2019-11-15 21:07:52,880 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c6a29b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:07:52, skipping insertion in model container [2019-11-15 21:07:52,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:07:52,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:07:52" (3/3) ... [2019-11-15 21:07:52,886 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcspn_malloc.i [2019-11-15 21:07:52,922 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:07:52,922 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:07:52,923 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:07:52,923 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:07:52,923 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:07:52,923 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:07:52,923 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:07:52,923 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:07:52,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:07:52,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:07:52,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:07:52,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:07:52,962 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:07:52,962 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:07:52,962 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:07:52,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 21:07:52,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:07:52,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:07:52,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:07:52,965 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:07:52,965 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:07:52,972 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true 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_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 10#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 6#L369-4true [2019-11-15 21:07:52,973 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 8#L374true assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 5#L369-3true 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 6#L369-4true [2019-11-15 21:07:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:52,977 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 21:07:52,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:52,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122637916] [2019-11-15 21:07:52,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:52,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:52,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:53,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:53,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-15 21:07:53,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:53,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784008849] [2019-11-15 21:07:53,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:53,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:53,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:07:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:07:53,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784008849] [2019-11-15 21:07:53,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:07:53,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:07:53,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563592295] [2019-11-15 21:07:53,163 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:07:53,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:07:53,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:07:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:07:53,175 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 21:07:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:07:53,180 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 21:07:53,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:07:53,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 21:07:53,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:07:53,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-15 21:07:53,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:07:53,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:07:53,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 21:07:53,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:07:53,189 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:07:53,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 21:07:53,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 21:07:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:07:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 21:07:53,214 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:07:53,214 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 21:07:53,214 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:07:53,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 21:07:53,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:07:53,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:07:53,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:07:53,216 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:07:53,216 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:07:53,216 INFO L791 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 50#L-1 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_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 47#L369-4 [2019-11-15 21:07:53,217 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 56#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 53#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 44#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 45#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 46#L369-3 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 47#L369-4 [2019-11-15 21:07:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:53,217 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 21:07:53,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:53,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589190843] [2019-11-15 21:07:53,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:53,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:53,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:53,258 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:53,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:53,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-15 21:07:53,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:53,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600974532] [2019-11-15 21:07:53,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:53,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:53,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:53,286 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:53,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:53,287 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-15 21:07:53,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:53,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576521150] [2019-11-15 21:07:53,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:53,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:53,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:53,367 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:53,679 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-15 21:07:54,079 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-15 21:07:54,408 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-11-15 21:07:54,573 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 21:07:54,586 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:07:54,589 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:07:54,589 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:07:54,589 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:07:54,597 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:07:54,597 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:07:54,597 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:07:54,597 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:07:54,598 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc.i_Iteration2_Lasso [2019-11-15 21:07:54,598 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:07:54,598 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:07:54,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,023 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-15 21:07:55,237 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-11-15 21:07:55,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:55,929 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2019-11-15 21:07:56,347 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 21:07:56,426 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:07:56,430 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:07:56,431 INFO L120 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 [2019-11-15 21:07:56,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:56,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:56,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:56,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:56,436 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:56,436 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:56,440 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:56,441 INFO L120 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 [2019-11-15 21:07:56,441 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:56,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:56,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:56,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:56,448 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:56,448 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:56,498 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:07:56,544 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:07:56,544 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 21:07:56,546 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:07:56,548 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:07:56,548 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:07:56,548 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~sc1~0.base)_1 Supporting invariants [] [2019-11-15 21:07:56,581 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 21:07:56,587 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:07:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:07:56,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:07:56,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:07:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:07:56,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:07:56,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:07:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:07:56,667 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:07:56,668 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 21:07:56,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-11-15 21:07:56,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:07:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:07:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 21:07:56,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 21:07:56,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:07:56,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 21:07:56,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:07:56,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-15 21:07:56,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:07:56,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 21:07:56,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:07:56,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-15 21:07:56,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:07:56,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:07:56,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 21:07:56,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:07:56,720 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:07:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 21:07:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 21:07:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 21:07:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 21:07:56,723 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:07:56,723 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:07:56,723 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:07:56,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 21:07:56,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:07:56,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:07:56,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:07:56,724 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:07:56,724 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:07:56,724 INFO L791 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 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_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 182#L382 assume !(main_~length1~0 < 1); 183#L382-2 assume !(main_~length2~0 < 1); 180#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 177#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 189#L372-5 [2019-11-15 21:07:56,725 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 184#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;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, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 189#L372-5 [2019-11-15 21:07:56,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:56,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-15 21:07:56,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:56,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890366536] [2019-11-15 21:07:56,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:56,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:56,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:56,761 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:56,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-15 21:07:56,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:56,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968972794] [2019-11-15 21:07:56,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:56,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:56,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:56,774 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-15 21:07:56,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:56,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733597272] [2019-11-15 21:07:56,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:56,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:56,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:56,819 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:57,404 WARN L191 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-11-15 21:07:57,552 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-15 21:07:57,554 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:07:57,554 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:07:57,554 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:07:57,554 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:07:57,554 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:07:57,554 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:07:57,554 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:07:57,554 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:07:57,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc.i_Iteration3_Lasso [2019-11-15 21:07:57,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:07:57,555 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:07:57,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:57,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:57,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:57,906 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-11-15 21:07:58,042 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-15 21:07:58,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:07:58,280 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-15 21:07:58,725 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 21:07:59,084 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:07:59,124 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:07:59,124 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:07:59,124 INFO L120 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 [2019-11-15 21:07:59,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:59,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:59,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:59,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:59,126 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:59,127 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:59,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:59,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:59,128 INFO L120 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 [2019-11-15 21:07:59,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:59,129 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:07:59,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:59,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:59,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:59,130 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:07:59,130 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:07:59,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:59,131 INFO L120 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 [2019-11-15 21:07:59,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:59,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:59,132 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:59,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:59,133 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:59,133 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:59,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:59,136 INFO L120 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 [2019-11-15 21:07:59,137 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:59,137 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:59,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:59,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:59,139 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:59,140 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:59,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:59,149 INFO L120 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 [2019-11-15 21:07:59,150 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:59,150 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:59,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:59,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:59,152 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:59,152 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:59,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:07:59,154 INFO L120 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 [2019-11-15 21:07:59,155 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:07:59,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:07:59,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:07:59,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:07:59,162 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:07:59,163 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:07:59,199 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:07:59,238 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 21:07:59,239 INFO L444 ModelExtractionUtils]: 49 out of 55 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:07:59,239 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:07:59,240 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:07:59,241 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:07:59,241 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_2 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-11-15 21:07:59,295 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2019-11-15 21:07:59,296 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:07:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:07:59,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:07:59,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:07:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:07:59,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:07:59,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:07:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:07:59,358 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:07:59,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 21:07:59,385 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 43 states and 57 transitions. Complement of second has 5 states. [2019-11-15 21:07:59,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:07:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:07:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 21:07:59,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 21:07:59,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:07:59,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 21:07:59,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:07:59,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 21:07:59,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:07:59,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 21:07:59,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:07:59,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-15 21:07:59,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:07:59,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:07:59,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 21:07:59,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:07:59,391 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 21:07:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 21:07:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 21:07:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 21:07:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 21:07:59,394 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 21:07:59,394 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 21:07:59,394 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:07:59,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 21:07:59,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:07:59,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:07:59,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:07:59,396 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:07:59,396 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:07:59,397 INFO L791 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 362#L-1 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_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 363#L382 assume !(main_~length1~0 < 1); 364#L382-2 assume !(main_~length2~0 < 1); 361#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 357#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 358#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 371#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 367#L372-1 assume !cstrcspn_#t~short210; 368#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 353#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 354#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 355#L369-3 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 356#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 360#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 370#L372-5 [2019-11-15 21:07:59,397 INFO L793 eck$LassoCheckResult]: Loop: 370#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 365#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 366#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;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, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 370#L372-5 [2019-11-15 21:07:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:59,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-15 21:07:59,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:59,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175951148] [2019-11-15 21:07:59,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:59,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:59,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:59,428 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-15 21:07:59,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:59,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581079522] [2019-11-15 21:07:59,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:59,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:59,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:07:59,437 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:07:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:07:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1999924968, now seen corresponding path program 1 times [2019-11-15 21:07:59,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:07:59,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468234955] [2019-11-15 21:07:59,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:59,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:07:59,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:07:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:07:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:07:59,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468234955] [2019-11-15 21:07:59,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074652910] [2019-11-15 21:07:59,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0be3cef6-38f1-454c-b161-77f16632558e/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:07:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:07:59,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 21:07:59,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:07:59,658 INFO L341 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2019-11-15 21:07:59,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 36 treesize of output 21 [2019-11-15 21:07:59,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:07:59,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:07:59,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 21:07:59,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:36, output treesize:21 [2019-11-15 21:08:39,099 WARN L191 SmtUtils]: Spent 862.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-15 21:09:04,677 WARN L191 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 21:09:20,375 WARN L191 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 21:09:20,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:09:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:09:20,397 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:09:20,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-15 21:09:20,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216274649] [2019-11-15 21:09:20,589 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 21:09:20,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:09:20,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 21:09:20,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=115, Unknown=8, NotChecked=0, Total=156 [2019-11-15 21:09:20,590 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 13 states. [2019-11-15 21:09:23,833 WARN L191 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-11-15 21:09:26,731 WARN L191 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-11-15 21:09:29,369 WARN L191 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-11-15 21:09:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:09:29,419 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-11-15 21:09:29,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:09:29,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 72 transitions. [2019-11-15 21:09:29,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:09:29,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 43 states and 53 transitions. [2019-11-15 21:09:29,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 21:09:29,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 21:09:29,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 53 transitions. [2019-11-15 21:09:29,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:09:29,427 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-15 21:09:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 53 transitions. [2019-11-15 21:09:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2019-11-15 21:09:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 21:09:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-15 21:09:29,430 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 21:09:29,430 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-15 21:09:29,430 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:09:29,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-15 21:09:29,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:09:29,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:09:29,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:09:29,432 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:09:29,432 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:09:29,432 INFO L791 eck$LassoCheckResult]: Stem: 530#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 523#L-1 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_~res~0;main_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 524#L382 assume !(main_~length1~0 < 1); 525#L382-2 assume !(main_~length2~0 < 1); 522#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnHeap(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnHeap(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);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; 518#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 519#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 538#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 528#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 529#L372-3 assume !cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209; 514#L372-6 call cstrcspn_#t~mem212 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1); 515#L374 assume !(cstrcspn_#t~mem212 == cstrcspn_~c~0);havoc cstrcspn_#t~mem212; 516#L369-3 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, 1 + cstrcspn_#t~post205.offset;havoc cstrcspn_#t~post205.base, cstrcspn_#t~post205.offset; 517#L369-4 call cstrcspn_#t~mem206 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1); 521#L369-1 assume !!(0 != cstrcspn_#t~mem206);havoc cstrcspn_#t~mem206;cstrcspn_~s~0.base, cstrcspn_~s~0.offset := cstrcspn_~s2.base, cstrcspn_~s2.offset;call cstrcspn_#t~mem207 := read~int(cstrcspn_~sc1~0.base, cstrcspn_~sc1~0.offset, 1);cstrcspn_~c~0 := cstrcspn_#t~mem207;havoc cstrcspn_#t~mem207; 531#L372-5 [2019-11-15 21:09:29,432 INFO L793 eck$LassoCheckResult]: Loop: 531#L372-5 call cstrcspn_#t~mem208 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := 0 != cstrcspn_#t~mem208; 526#L372-1 assume cstrcspn_#t~short210;call cstrcspn_#t~mem209 := read~int(cstrcspn_~s~0.base, cstrcspn_~s~0.offset, 1);cstrcspn_#t~short210 := cstrcspn_#t~mem209 != (if cstrcspn_~c~0 % 256 <= 127 then cstrcspn_~c~0 % 256 else cstrcspn_~c~0 % 256 - 256); 527#L372-3 assume !!cstrcspn_#t~short210;havoc cstrcspn_#t~short210;havoc cstrcspn_#t~mem208;havoc cstrcspn_#t~mem209;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, 1 + cstrcspn_#t~post211.offset;havoc cstrcspn_#t~post211.base, cstrcspn_#t~post211.offset; 531#L372-5 [2019-11-15 21:09:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-15 21:09:29,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:29,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295981475] [2019-11-15 21:09:29,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:09:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:09:29,461 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:09:29,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:29,461 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-15 21:09:29,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:29,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039345423] [2019-11-15 21:09:29,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:09:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:09:29,469 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:09:29,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:29,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-15 21:09:29,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:09:29,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493076684] [2019-11-15 21:09:29,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:09:29,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:09:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:09:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:09:29,501 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:09:30,289 WARN L191 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 144 [2019-11-15 21:09:31,221 WARN L191 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 116 [2019-11-15 21:09:31,224 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:09:31,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:09:31,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:09:31,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:09:31,225 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:09:31,225 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:09:31,225 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:09:31,225 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:09:31,225 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcspn_malloc.i_Iteration5_Lasso [2019-11-15 21:09:31,225 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:09:31,225 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:09:31,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:31,471 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 21:09:32,332 WARN L191 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-11-15 21:09:32,461 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-11-15 21:09:32,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:32,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:32,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:32,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:32,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:09:32,733 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-11-15 21:09:33,271 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 21:09:33,903 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 46 [2019-11-15 21:09:34,050 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 21:09:34,058 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:09:34,058 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:09:34,059 INFO L120 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 [2019-11-15 21:09:34,069 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,069 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,070 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,070 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,071 INFO L120 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 [2019-11-15 21:09:34,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,074 INFO L120 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 [2019-11-15 21:09:34,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,076 INFO L120 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 [2019-11-15 21:09:34,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:09:34,078 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:09:34,079 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,079 INFO L120 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 [2019-11-15 21:09:34,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,081 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,081 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,082 INFO L120 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 [2019-11-15 21:09:34,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,083 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,084 INFO L120 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 [2019-11-15 21:09:34,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,087 INFO L120 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 [2019-11-15 21:09:34,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,088 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,088 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:09:34,089 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:09:34,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,090 INFO L120 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 [2019-11-15 21:09:34,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,092 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,092 INFO L120 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 [2019-11-15 21:09:34,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,095 INFO L120 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 [2019-11-15 21:09:34,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,096 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,096 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,096 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,096 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,096 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,096 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,097 INFO L120 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 [2019-11-15 21:09:34,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,098 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,099 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,099 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,100 INFO L120 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 [2019-11-15 21:09:34,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,100 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:09:34,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,101 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:09:34,101 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:09:34,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,102 INFO L120 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 [2019-11-15 21:09:34,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,104 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:09:34,104 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:09:34,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,109 INFO L120 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 [2019-11-15 21:09:34,109 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,109 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:09:34,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,114 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:09:34,115 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:09:34,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,135 INFO L120 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 [2019-11-15 21:09:34,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,137 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:09:34,137 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:09:34,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,138 INFO L120 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 [2019-11-15 21:09:34,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,140 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:09:34,140 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:09:34,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:09:34,142 INFO L120 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 [2019-11-15 21:09:34,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:09:34,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:09:34,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:09:34,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:09:34,146 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:09:34,146 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:09:34,187 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:09:34,242 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 21:09:34,242 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:09:34,242 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:09:34,244 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:09:34,247 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:09:34,247 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3, ULTIMATE.start_cstrcspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0.base)_3 - 1*ULTIMATE.start_cstrcspn_~s~0.offset Supporting invariants [] [2019-11-15 21:09:34,350 INFO L297 tatePredicateManager]: 30 out of 30 supporting invariants were superfluous and have been removed [2019-11-15 21:09:34,351 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:09:34,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:34,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:09:34,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:09:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:34,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:09:34,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:09:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:09:34,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:09:34,400 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:09:34,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-11-15 21:09:34,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:09:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:09:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 21:09:34,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:09:34,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:09:34,427 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:09:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:34,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:09:34,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:09:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:34,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:09:34,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:09:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:09:34,478 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:09:34,478 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:09:34,492 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 46 states and 58 transitions. Complement of second has 5 states. [2019-11-15 21:09:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:09:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:09:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 21:09:34,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:09:34,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:09:34,494 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:09:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:09:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:34,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:09:34,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:09:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:09:34,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:09:34,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:09:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:09:34,546 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:09:34,546 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 21:09:34,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 45 states and 60 transitions. Complement of second has 4 states. [2019-11-15 21:09:34,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 21:09:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:09:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-15 21:09:34,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 21:09:34,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:09:34,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 21:09:34,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:09:34,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 21:09:34,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:09:34,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2019-11-15 21:09:34,570 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:09:34,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-11-15 21:09:34,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:09:34,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:09:34,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:09:34,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:09:34,571 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:09:34,571 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:09:34,572 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:09:34,572 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:09:34,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:09:34,572 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:09:34,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:09:34,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:09:34 BoogieIcfgContainer [2019-11-15 21:09:34,578 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:09:34,578 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:09:34,578 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:09:34,579 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:09:34,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:07:52" (3/4) ... [2019-11-15 21:09:34,582 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:09:34,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:09:34,583 INFO L168 Benchmark]: Toolchain (without parser) took 102894.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.8 MB). Free memory was 943.4 MB in the beginning and 891.2 MB in the end (delta: 52.2 MB). Peak memory consumption was 392.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:09:34,583 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:09:34,584 INFO L168 Benchmark]: CACSL2BoogieTranslator took 625.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:09:34,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:09:34,584 INFO L168 Benchmark]: Boogie Preprocessor took 41.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:09:34,585 INFO L168 Benchmark]: RCFGBuilder took 455.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:09:34,586 INFO L168 Benchmark]: BuchiAutomizer took 101705.89 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 891.2 MB in the end (delta: 162.2 MB). Peak memory consumption was 396.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:09:34,586 INFO L168 Benchmark]: Witness Printer took 3.49 ms. Allocated memory is still 1.4 GB. Free memory is still 891.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:09:34,589 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 625.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -138.9 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 455.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 101705.89 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 233.8 MB). Free memory was 1.1 GB in the beginning and 891.2 MB in the end (delta: 162.2 MB). Peak memory consumption was 396.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.49 ms. Allocated memory is still 1.4 GB. Free memory is still 891.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 101.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 92.2s. Construction of modules took 0.1s. Büchi inclusion checks took 9.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 28 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 106 SDtfs, 145 SDslu, 80 SDs, 0 SdLazy, 141 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital386 mio100 ax100 hnf99 lsp91 ukn74 mio100 lsp32 div127 bol100 ite100 ukn100 eq168 hnf81 smp90 dnf962 smp33 tf100 neg96 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 11 VariablesLoop: 8 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...