./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.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_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/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 b0714679a57fe7287c2b60684006200e7d793859 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:03:47,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:03:47,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:03:47,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:03:47,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:03:47,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:03:47,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:03:47,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:03:47,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:03:47,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:03:47,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:03:47,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:03:47,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:03:47,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:03:47,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:03:47,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:03:47,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:03:47,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:03:47,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:03:47,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:03:47,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:03:47,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:03:47,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:03:47,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:03:47,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:03:47,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:03:47,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:03:47,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:03:47,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:03:47,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:03:47,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:03:47,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:03:47,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:03:47,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:03:47,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:03:47,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:03:47,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:03:47,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:03:47,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:03:47,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:03:47,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:03:47,519 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:03:47,538 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:03:47,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:03:47,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:03:47,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:03:47,541 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:03:47,541 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:03:47,541 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:03:47,542 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:03:47,542 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:03:47,542 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:03:47,543 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:03:47,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:03:47,544 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:03:47,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:03:47,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:03:47,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:03:47,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:03:47,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:03:47,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:03:47,546 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:03:47,546 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:03:47,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:03:47,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:03:47,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:03:47,547 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:03:47,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:03:47,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:03:47,548 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:03:47,549 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:03:47,549 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_cce8f22f-8a7f-4047-bea1-c39077c37cd6/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 -> b0714679a57fe7287c2b60684006200e7d793859 [2019-11-15 20:03:47,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:03:47,610 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:03:47,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:03:47,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:03:47,620 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:03:47,621 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/../../sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i [2019-11-15 20:03:47,683 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/data/3d7867874/079b3473dc5e458384344ed23c563c48/FLAGf6548696c [2019-11-15 20:03:48,128 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:03:48,129 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/sv-benchmarks/c/termination-15/cstrspn_reverse_alloca.i [2019-11-15 20:03:48,140 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/data/3d7867874/079b3473dc5e458384344ed23c563c48/FLAGf6548696c [2019-11-15 20:03:48,501 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/bin/uautomizer/data/3d7867874/079b3473dc5e458384344ed23c563c48 [2019-11-15 20:03:48,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:03:48,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:03:48,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:03:48,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:03:48,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:03:48,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:03:48" (1/1) ... [2019-11-15 20:03:48,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdeb2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:48, skipping insertion in model container [2019-11-15 20:03:48,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:03:48" (1/1) ... [2019-11-15 20:03:48,520 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:03:48,552 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:03:48,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:03:49,010 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:03:49,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:03:49,114 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:03:49,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49 WrapperNode [2019-11-15 20:03:49,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:03:49,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:03:49,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:03:49,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:03:49,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... [2019-11-15 20:03:49,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... [2019-11-15 20:03:49,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:03:49,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:03:49,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:03:49,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:03:49,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... [2019-11-15 20:03:49,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... [2019-11-15 20:03:49,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... [2019-11-15 20:03:49,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... [2019-11-15 20:03:49,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... [2019-11-15 20:03:49,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... [2019-11-15 20:03:49,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... [2019-11-15 20:03:49,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:03:49,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:03:49,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:03:49,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:03:49,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cce8f22f-8a7f-4047-bea1-c39077c37cd6/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 20:03:49,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:03:49,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:03:49,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:03:49,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:03:49,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:03:49,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:03:49,567 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:03:49,567 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 20:03:49,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:03:49 BoogieIcfgContainer [2019-11-15 20:03:49,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:03:49,569 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:03:49,569 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:03:49,572 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:03:49,590 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:03:49,590 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:03:48" (1/3) ... [2019-11-15 20:03:49,591 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cfe768c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:03:49, skipping insertion in model container [2019-11-15 20:03:49,591 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:03:49,591 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:03:49" (2/3) ... [2019-11-15 20:03:49,592 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cfe768c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:03:49, skipping insertion in model container [2019-11-15 20:03:49,592 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:03:49,592 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:03:49" (3/3) ... [2019-11-15 20:03:49,593 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn_reverse_alloca.i [2019-11-15 20:03:49,632 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:03:49,632 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:03:49,632 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:03:49,633 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:03:49,633 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:03:49,633 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:03:49,633 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:03:49,633 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:03:49,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 20:03:49,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 20:03:49,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:03:49,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:03:49,667 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:03:49,667 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:03:49,668 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:03:49,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-15 20:03:49,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 20:03:49,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:03:49,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:03:49,670 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:03:49,670 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:03:49,677 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_~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); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(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.allocOnStack(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, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 6#L369-4true [2019-11-15 20:03:49,678 INFO L793 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 18#L369-1true assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 8#L374true assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 5#L369-3true cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 6#L369-4true [2019-11-15 20:03:49,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:49,682 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-11-15 20:03:49,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:49,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409359079] [2019-11-15 20:03:49,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:49,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:49,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:49,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:49,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:49,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2019-11-15 20:03:49,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:49,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196813544] [2019-11-15 20:03:49,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:49,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:49,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:49,861 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 20:03:49,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196813544] [2019-11-15 20:03:49,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:03:49,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:03:49,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803724490] [2019-11-15 20:03:49,867 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:03:49,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:03:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:03:49,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:03:49,885 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-15 20:03:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:03:49,891 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-11-15 20:03:49,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:03:49,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-11-15 20:03:49,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 20:03:49,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2019-11-15 20:03:49,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 20:03:49,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 20:03:49,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-11-15 20:03:49,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:03:49,901 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 20:03:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-11-15 20:03:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 20:03:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 20:03:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-11-15 20:03:49,928 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 20:03:49,928 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-11-15 20:03:49,929 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:03:49,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-11-15 20:03:49,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 20:03:49,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:03:49,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:03:49,930 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 20:03:49,930 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:03:49,931 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_~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.allocOnStack(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.allocOnStack(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, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 47#L369-4 [2019-11-15 20:03:49,931 INFO L793 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 48#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 56#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 53#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 54#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 44#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 45#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 46#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 47#L369-4 [2019-11-15 20:03:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:49,932 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2019-11-15 20:03:49,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:49,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50731212] [2019-11-15 20:03:49,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:49,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:49,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:50,020 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:50,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:50,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2019-11-15 20:03:50,026 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:50,026 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852460173] [2019-11-15 20:03:50,026 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:50,027 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:50,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:50,067 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2019-11-15 20:03:50,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:50,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590010402] [2019-11-15 20:03:50,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:50,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:50,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:50,210 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:50,420 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-11-15 20:03:50,710 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-11-15 20:03:51,092 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 96 [2019-11-15 20:03:51,237 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-15 20:03:51,250 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:03:51,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:03:51,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:03:51,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:03:51,259 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:03:51,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:03:51,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:03:51,260 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:03:51,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca.i_Iteration2_Lasso [2019-11-15 20:03:51,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:03:51,261 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:03:51,293 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 20:03:51,299 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 20:03:51,303 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 20:03:51,306 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 20:03:51,309 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 20:03:51,312 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 20:03:51,315 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 20:03:51,317 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 20:03:51,320 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 20:03:51,323 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 20:03:51,325 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 20:03:51,715 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-11-15 20:03:51,964 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-15 20:03:51,965 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 20:03:51,967 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 20:03:51,969 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 20:03:51,974 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 20:03:51,980 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 20:03:51,983 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 20:03:51,985 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 20:03:52,621 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-11-15 20:03:53,018 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-11-15 20:03:53,048 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:03:53,053 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:03:53,055 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 20:03:53,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,057 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:53,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,058 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,060 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:53,060 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:53,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,062 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 20:03:53,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,064 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,066 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:03:53,066 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:53,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,070 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 20:03:53,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:53,071 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,071 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,071 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,071 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:53,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:53,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,072 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 20:03:53,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,073 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:53,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,074 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:53,074 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:53,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,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 20:03:53,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:03:53,079 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:53,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,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 20:03:53,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:53,082 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:53,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:53,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,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 20:03:53,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:53,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:53,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:53,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,091 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 20:03:53,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,097 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:53,098 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,098 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,098 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,098 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:53,099 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:53,100 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,101 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 20:03:53,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,103 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:53,103 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,103 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,104 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:53,105 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:53,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,107 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 20:03:53,108 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:53,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,109 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,112 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:53,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:53,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,115 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 20:03:53,116 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,117 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,117 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,118 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:03:53,122 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:53,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:53,126 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 20:03:53,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:53,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:53,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:53,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:53,138 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:03:53,147 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:53,239 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:03:53,267 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:03:53,268 INFO L444 ModelExtractionUtils]: 43 out of 49 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 20:03:53,270 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:03:53,271 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:03:53,272 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:03:53,272 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset) = 2*ULTIMATE.start_cstrspn_~sc1~0.offset + 1 Supporting invariants [] [2019-11-15 20:03:53,310 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-15 20:03:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:53,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:03:53,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:53,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:03:53,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:53,390 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 20:03:53,393 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 20:03:53,393 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 20:03:53,438 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 20:03:53,440 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 20:03:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:03:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 20:03:53,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2019-11-15 20:03:53,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:03:53,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2019-11-15 20:03:53,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:03:53,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2019-11-15 20:03:53,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:03:53,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 20:03:53,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:03:53,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2019-11-15 20:03:53,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 20:03:53,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 20:03:53,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2019-11-15 20:03:53,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:03:53,446 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 20:03:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2019-11-15 20:03:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-15 20:03:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 20:03:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 20:03:53,448 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 20:03:53,448 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 20:03:53,448 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:03:53,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 20:03:53,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:03:53,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:03:53,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:03:53,450 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:03:53,450 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:03:53,451 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_~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.allocOnStack(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.allocOnStack(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, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 177#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 179#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 189#L372-5 [2019-11-15 20:03:53,451 INFO L793 eck$LassoCheckResult]: Loop: 189#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 184#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 185#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset - 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 189#L372-5 [2019-11-15 20:03:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:53,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2019-11-15 20:03:53,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:53,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109110303] [2019-11-15 20:03:53,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:53,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:53,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:53,526 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:53,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2019-11-15 20:03:53,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:53,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890800353] [2019-11-15 20:03:53,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:53,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:53,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:53,546 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:53,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:53,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2019-11-15 20:03:53,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:53,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315039393] [2019-11-15 20:03:53,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:53,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:53,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:53,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:54,202 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2019-11-15 20:03:54,342 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-15 20:03:54,344 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:03:54,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:03:54,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:03:54,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:03:54,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:03:54,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:03:54,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:03:54,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:03:54,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca.i_Iteration3_Lasso [2019-11-15 20:03:54,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:03:54,345 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:03:54,351 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 20:03:54,355 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 20:03:54,357 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 20:03:54,710 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2019-11-15 20:03:54,818 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 20:03:54,820 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 20:03:54,822 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 20:03:54,823 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 20:03:54,832 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 20:03:54,834 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 20:03:54,835 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 20:03:54,838 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 20:03:54,840 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 20:03:54,841 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 20:03:54,843 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 20:03:54,844 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 20:03:54,847 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 20:03:54,848 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 20:03:54,851 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 20:03:55,401 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 20:03:55,883 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 20:03:56,040 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:03:56,040 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:03:56,040 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 20:03:56,041 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:56,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:56,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:56,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:56,041 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:56,042 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:56,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:56,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:56,043 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 20:03:56,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:56,043 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:03:56,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:56,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:56,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:56,044 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:03:56,044 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:03:56,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:56,045 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 20:03:56,045 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:56,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:56,046 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:56,046 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:56,047 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:03:56,047 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:56,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:56,049 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 20:03:56,050 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:56,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:56,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:56,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:56,051 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:03:56,051 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:56,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:56,053 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 20:03:56,054 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:56,054 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:03:56,054 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 20:03:56,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:56,086 INFO L400 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2019-11-15 20:03:56,086 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-15 20:03:56,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:56,213 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 20:03:56,213 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:56,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:56,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:56,214 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:56,215 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:03:56,215 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:56,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:56,220 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 20:03:56,221 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:56,221 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:03:56,222 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:56,222 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:56,225 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:03:56,226 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:56,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:56,245 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 20:03:56,245 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:56,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:56,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:56,246 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:56,246 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:03:56,247 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:56,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:03:56,249 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 20:03:56,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:03:56,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:03:56,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:03:56,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:03:56,254 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:03:56,254 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:03:56,285 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:03:56,304 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:03:56,304 INFO L444 ModelExtractionUtils]: 50 out of 55 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 20:03:56,305 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:03:56,306 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:03:56,306 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:03:56,306 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset) = 2*ULTIMATE.start_cstrspn_~s~0.offset + 1 Supporting invariants [] [2019-11-15 20:03:56,369 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2019-11-15 20:03:56,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:56,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:03:56,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:56,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:03:56,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:56,432 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 20:03:56,432 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 20:03:56,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 20:03:56,469 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 20:03:56,470 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 20:03:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:03:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 20:03:56,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-15 20:03:56,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:03:56,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-15 20:03:56,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:03:56,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-15 20:03:56,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:03:56,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2019-11-15 20:03:56,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:03:56,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2019-11-15 20:03:56,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 20:03:56,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 20:03:56,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2019-11-15 20:03:56,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:03:56,476 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-11-15 20:03:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2019-11-15 20:03:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-15 20:03:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 20:03:56,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 20:03:56,479 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 20:03:56,479 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 20:03:56,479 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:03:56,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 20:03:56,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:03:56,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:03:56,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:03:56,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:03:56,481 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:03:56,481 INFO L791 eck$LassoCheckResult]: Stem: 365#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 358#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_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 359#L382 assume !(main_~length1~0 < 1); 360#L382-2 assume !(main_~length2~0 < 1); 357#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(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.allocOnStack(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, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 353#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 354#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 367#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 363#L372-1 assume !cstrspn_#t~short210; 364#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 349#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 350#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 351#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 352#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 356#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 366#L372-5 [2019-11-15 20:03:56,481 INFO L793 eck$LassoCheckResult]: Loop: 366#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 361#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 362#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset - 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 366#L372-5 [2019-11-15 20:03:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:56,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2019-11-15 20:03:56,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:56,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751732158] [2019-11-15 20:03:56,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:56,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751732158] [2019-11-15 20:03:56,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:03:56,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:03:56,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564941653] [2019-11-15 20:03:56,567 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:03:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2019-11-15 20:03:56,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:56,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215524494] [2019-11-15 20:03:56,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:56,574 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:56,801 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-15 20:03:56,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:03:56,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:03:56,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:03:56,802 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-15 20:03:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:03:56,913 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-15 20:03:56,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:03:56,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-15 20:03:56,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 20:03:56,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2019-11-15 20:03:56,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 20:03:56,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 20:03:56,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2019-11-15 20:03:56,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:03:56,916 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 20:03:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2019-11-15 20:03:56,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-15 20:03:56,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 20:03:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-15 20:03:56,919 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 20:03:56,919 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 20:03:56,919 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:03:56,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-15 20:03:56,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 20:03:56,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:03:56,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:03:56,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:03:56,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:03:56,921 INFO L791 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 430#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_~length1~0 := main_#t~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 431#L382 assume !(main_~length1~0 < 1); 432#L382-2 assume !(main_~length2~0 < 1); 429#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(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.allocOnStack(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, 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset, 1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem207, cstrspn_#t~post211.base, cstrspn_#t~post211.offset, cstrspn_#t~mem208, cstrspn_#t~mem209, cstrspn_#t~short210, cstrspn_#t~mem212, cstrspn_#t~post205.base, cstrspn_#t~post205.offset, cstrspn_#t~mem206, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 425#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 426#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 444#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 443#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 442#L372-3 assume !cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208; 421#L372-6 call cstrspn_#t~mem212 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 422#L374 assume !(cstrspn_#t~mem212 != cstrspn_~c~0);havoc cstrspn_#t~mem212; 423#L369-3 cstrspn_#t~post205.base, cstrspn_#t~post205.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post205.base, cstrspn_#t~post205.offset - 1;havoc cstrspn_#t~post205.base, cstrspn_#t~post205.offset; 424#L369-4 call cstrspn_#t~mem206 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 428#L369-1 assume !!(0 != cstrspn_#t~mem206);havoc cstrspn_#t~mem206;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem207 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem207;havoc cstrspn_#t~mem207; 438#L372-5 [2019-11-15 20:03:56,922 INFO L793 eck$LassoCheckResult]: Loop: 438#L372-5 call cstrspn_#t~mem208 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := 0 != cstrspn_#t~mem208; 433#L372-1 assume cstrspn_#t~short210;call cstrspn_#t~mem209 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short210 := cstrspn_#t~mem209 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 434#L372-3 assume !!cstrspn_#t~short210;havoc cstrspn_#t~short210;havoc cstrspn_#t~mem209;havoc cstrspn_#t~mem208;cstrspn_#t~post211.base, cstrspn_#t~post211.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post211.base, cstrspn_#t~post211.offset - 1;havoc cstrspn_#t~post211.base, cstrspn_#t~post211.offset; 438#L372-5 [2019-11-15 20:03:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:56,922 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2019-11-15 20:03:56,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:56,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211539637] [2019-11-15 20:03:56,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:56,965 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:56,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:56,965 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2019-11-15 20:03:56,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:56,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468674387] [2019-11-15 20:03:56,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:56,973 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:56,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:56,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2019-11-15 20:03:56,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:03:56,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659250126] [2019-11-15 20:03:56,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:03:56,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:03:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:03:57,026 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:03:57,844 WARN L191 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 144 [2019-11-15 20:03:59,048 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 116 DAG size of output: 116 [2019-11-15 20:03:59,050 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:03:59,050 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:03:59,050 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:03:59,050 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:03:59,050 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:03:59,051 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:03:59,051 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:03:59,051 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:03:59,051 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrspn_reverse_alloca.i_Iteration5_Lasso [2019-11-15 20:03:59,051 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:03:59,051 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:03:59,058 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 20:03:59,065 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 20:03:59,073 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 20:03:59,077 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 20:03:59,078 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 20:03:59,086 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 20:03:59,088 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 20:03:59,090 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 20:03:59,092 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 20:03:59,094 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 20:03:59,101 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 20:03:59,105 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 20:03:59,110 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 20:03:59,112 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 20:03:59,113 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 20:03:59,115 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 20:03:59,122 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 20:03:59,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 20:04:00,112 WARN L191 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 104 [2019-11-15 20:04:00,246 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-15 20:04:00,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 20:04:00,873 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-11-15 20:04:01,034 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-15 20:04:01,373 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 20:04:01,513 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:04:01,513 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:04:01,513 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 20:04:01,514 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,514 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,515 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,515 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,515 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,515 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,515 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,516 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,516 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 20:04:01,517 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,517 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,517 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,517 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,518 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,518 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,518 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,518 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,519 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 20:04:01,519 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,520 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,520 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,520 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,521 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:04:01,521 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:04:01,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,522 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 20:04:01,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,523 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,523 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,524 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,524 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,525 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 20:04:01,525 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,525 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,526 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,526 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,526 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,526 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,527 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 20:04:01,528 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,528 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,528 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,528 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,528 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,529 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,529 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,530 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 20:04:01,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,531 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,532 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 20:04:01,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,533 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,534 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,534 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,535 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 20:04:01,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,535 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,536 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,537 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 20:04:01,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,538 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,538 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,539 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:04:01,539 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:04:01,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,540 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 20:04:01,541 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,541 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,542 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,542 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,543 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 20:04:01,543 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,543 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,544 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,544 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,544 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,544 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,544 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,545 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 20:04:01,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,546 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,548 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 20:04:01,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,548 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,549 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,549 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,550 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,550 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 20:04:01,551 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,551 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,551 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,551 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,551 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,552 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,552 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,553 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 20:04:01,553 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,553 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:04:01,553 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,554 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,554 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:04:01,554 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:04:01,555 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,555 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 20:04:01,555 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,556 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:04:01,556 INFO L203 nArgumentSynthesizer]: 6 loop disjuncts [2019-11-15 20:04:01,556 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,590 INFO L400 nArgumentSynthesizer]: We have 132 Motzkin's Theorem applications. [2019-11-15 20:04:01,591 INFO L401 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2019-11-15 20:04:01,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,832 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 20:04:01,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,833 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 20:04:01,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,833 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,841 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:04:01,841 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:04:01,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,867 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 20:04:01,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,869 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,870 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:04:01,870 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:04:01,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,872 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 20:04:01,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,873 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,874 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:04:01,874 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:04:01,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,878 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 20:04:01,878 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,879 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,879 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,879 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:04:01,880 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:04:01,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,883 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 20:04:01,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,884 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,886 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:04:01,886 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:04:01,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:04:01,889 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 20:04:01,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:04:01,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:04:01,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:04:01,890 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:04:01,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:04:01,892 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:04:01,936 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:04:01,955 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 20:04:01,955 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 20:04:01,956 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:04:01,958 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:04:01,958 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:04:01,958 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3) = 2*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~s~0.base)_3 Supporting invariants [] [2019-11-15 20:04:02,078 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:04:02,079 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:04:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:02,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:02,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:02,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:04:02,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:02,142 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 20:04:02,143 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 20:04:02,143 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 20:04:02,177 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-11-15 20:04:02,179 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 20:04:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:04:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 20:04:02,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 20:04:02,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:04:02,180 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:04:02,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:02,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:02,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:02,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:04:02,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:02,246 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 20:04:02,246 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 20:04:02,247 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 20:04:02,273 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 51 transitions. Complement of second has 5 states. [2019-11-15 20:04:02,276 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 20:04:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:04:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2019-11-15 20:04:02,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 20:04:02,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:04:02,277 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:04:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:02,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:04:02,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:02,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 20:04:02,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:02,352 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 20:04:02,353 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 20:04:02,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 20:04:02,386 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 41 states and 53 transitions. Complement of second has 4 states. [2019-11-15 20:04:02,387 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 20:04:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:04:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-11-15 20:04:02,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-15 20:04:02,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:04:02,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-15 20:04:02,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:04:02,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 20:04:02,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:04:02,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-11-15 20:04:02,391 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:04:02,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2019-11-15 20:04:02,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:04:02,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:04:02,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:04:02,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:04:02,392 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:04:02,392 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:04:02,392 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:04:02,392 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:04:02,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:04:02,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:04:02,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:04:02,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:04:02 BoogieIcfgContainer [2019-11-15 20:04:02,400 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:04:02,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:04:02,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:04:02,401 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:04:02,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:03:49" (3/4) ... [2019-11-15 20:04:02,406 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:04:02,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:04:02,408 INFO L168 Benchmark]: Toolchain (without parser) took 13903.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.4 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -258.3 MB). Peak memory consumption was 73.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:02,408 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:04:02,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 609.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:02,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:02,416 INFO L168 Benchmark]: Boogie Preprocessor took 28.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:04:02,417 INFO L168 Benchmark]: RCFGBuilder took 374.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:02,417 INFO L168 Benchmark]: BuchiAutomizer took 12831.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.0 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:02,417 INFO L168 Benchmark]: Witness Printer took 5.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:04:02,423 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 609.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -179.1 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 374.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12831.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -107.0 MB). Peak memory consumption was 83.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.80 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 2 * sc1 + 1 and consists of 3 locations. One deterministic module has affine ranking function 2 * s + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * s + unknown-#length-unknown[s] and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 11.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 114 SDtfs, 112 SDslu, 56 SDs, 0 SdLazy, 87 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital400 mio100 ax100 hnf99 lsp91 ukn77 mio100 lsp42 div114 bol100 ite100 ukn100 eq182 hnf77 smp96 dnf501 smp43 tf100 neg96 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 276ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 132 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...