./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 646417a8dd8807492175439f0c109786ec3887ae ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:25:41,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:41,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:41,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:41,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:41,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:41,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:41,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:41,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:41,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:41,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:41,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:41,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:41,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:41,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:41,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:41,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:41,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:41,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:41,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:41,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:41,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:41,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:41,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:41,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:41,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:41,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:41,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:41,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:41,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:41,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:41,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:41,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:41,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:41,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:41,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:41,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:41,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:41,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:41,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:41,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:41,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:41,567 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:41,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:41,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:41,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:41,575 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:41,575 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:41,575 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:41,576 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:41,576 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:41,576 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:41,577 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:41,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:41,577 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:41,578 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:41,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:41,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:41,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:41,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:41,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:41,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:41,580 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:41,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:41,580 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:41,581 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:41,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:41,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:41,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:41,582 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:41,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:41,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:41,584 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:41,585 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:41,586 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:41,587 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 646417a8dd8807492175439f0c109786ec3887ae [2020-07-29 03:25:41,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:41,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:41,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:41,941 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:41,944 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:41,945 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2020-07-29 03:25:42,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbc57c02/1b162e85f8014a60b00997761cc33545/FLAG1c885a0dd [2020-07-29 03:25:42,561 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:42,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrspn-alloca-1.i [2020-07-29 03:25:42,581 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbc57c02/1b162e85f8014a60b00997761cc33545/FLAG1c885a0dd [2020-07-29 03:25:42,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bbc57c02/1b162e85f8014a60b00997761cc33545 [2020-07-29 03:25:42,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:42,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:42,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:42,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:42,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:42,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:42" (1/1) ... [2020-07-29 03:25:42,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fbe3035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:42, skipping insertion in model container [2020-07-29 03:25:42,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:42" (1/1) ... [2020-07-29 03:25:42,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:42,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:43,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:43,459 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:43,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:43,621 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:43,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43 WrapperNode [2020-07-29 03:25:43,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:43,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:43,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:43,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:43,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:43,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:43,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:43,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:43,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... [2020-07-29 03:25:43,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:43,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:43,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:43,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:43,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 03:25:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:43,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:44,340 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:44,340 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-29 03:25:44,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:44 BoogieIcfgContainer [2020-07-29 03:25:44,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:44,347 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:44,347 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:44,351 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:44,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:44,353 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:42" (1/3) ... [2020-07-29 03:25:44,355 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e701fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:44, skipping insertion in model container [2020-07-29 03:25:44,355 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:44,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:43" (2/3) ... [2020-07-29 03:25:44,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e701fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:44, skipping insertion in model container [2020-07-29 03:25:44,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:44,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:44" (3/3) ... [2020-07-29 03:25:44,361 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrspn-alloca-1.i [2020-07-29 03:25:44,414 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:44,414 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:44,414 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:44,414 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:44,415 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:44,415 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:44,415 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:44,415 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:44,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-29 03:25:44,456 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-07-29 03:25:44,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:44,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:44,462 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:44,462 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:44,462 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:44,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-29 03:25:44,466 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-07-29 03:25:44,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:44,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:44,467 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:25:44,467 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:44,474 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 13#L532true assume !(main_~length1~0 < 1); 18#L532-2true assume !(main_~length2~0 < 1); 9#L535-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 25#L541-3true [2020-07-29 03:25:44,475 INFO L796 eck$LassoCheckResult]: Loop: 25#L541-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 22#L541-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 25#L541-3true [2020-07-29 03:25:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 03:25:44,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:44,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269481338] [2020-07-29 03:25:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,634 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:44,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-07-29 03:25:44,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:44,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384304205] [2020-07-29 03:25:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,659 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:44,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:44,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-07-29 03:25:44,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:44,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664481981] [2020-07-29 03:25:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:45,014 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-07-29 03:25:45,135 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:45,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:45,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:45,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:45,137 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:45,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:45,138 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:45,138 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:45,138 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration1_Lasso [2020-07-29 03:25:45,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:45,139 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:45,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,402 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-07-29 03:25:45,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:45,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:46,158 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:46,165 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:46,180 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 [2020-07-29 03:25:46,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:46,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:46,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:46,241 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 [2020-07-29 03:25:46,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:46,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:46,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,248 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:46,297 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 [2020-07-29 03:25:46,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:46,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:46,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,303 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:46,359 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 [2020-07-29 03:25:46,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:46,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,417 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 [2020-07-29 03:25:46,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:46,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:46,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,466 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 [2020-07-29 03:25:46,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,477 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:46,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:46,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,523 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 [2020-07-29 03:25:46,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:46,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:46,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,575 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 [2020-07-29 03:25:46,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:46,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:46,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:46,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,645 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 [2020-07-29 03:25:46,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:46,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:46,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:46,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:46,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:46,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:46,669 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:46,696 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 03:25:46,696 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,735 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:46,766 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:46,767 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:46,767 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 03:25:46,830 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:46,834 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15;" "main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14;" [2020-07-29 03:25:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:46,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:46,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:46,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:46,917 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {34#unseeded} is VALID [2020-07-29 03:25:46,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {34#unseeded} is VALID [2020-07-29 03:25:46,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#unseeded} assume !(main_~length1~0 < 1); {34#unseeded} is VALID [2020-07-29 03:25:46,921 INFO L280 TraceCheckUtils]: 3: Hoare triple {34#unseeded} assume !(main_~length2~0 < 1); {34#unseeded} is VALID [2020-07-29 03:25:46,923 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {34#unseeded} is VALID [2020-07-29 03:25:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:46,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:46,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:46,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {37#(>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {94#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:25:46,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {94#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {77#(or (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:46,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:46,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:46,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:46,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:46,992 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 [2020-07-29 03:25:46,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2020-07-29 03:25:47,279 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 60 states and 87 transitions. Complement of second has 7 states. [2020-07-29 03:25:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:47,280 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:47,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-07-29 03:25:47,288 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-07-29 03:25:47,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:47,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:47,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:47,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:47,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:47,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:47,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 87 transitions. [2020-07-29 03:25:47,310 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 03:25:47,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:47,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:47,315 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states. [2020-07-29 03:25:47,321 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-07-29 03:25:47,328 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 03:25:47,328 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:47,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:47,336 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:47,336 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 87 transitions. cyclomatic complexity: 34 [2020-07-29 03:25:47,343 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:25:47,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:47,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:47,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:47,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:47,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:47,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:47,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 03:25:47,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 60 letters. [2020-07-29 03:25:47,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 60 letters. Loop has 60 letters. [2020-07-29 03:25:47,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:47,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:47,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:47,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:47,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:47,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:47,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 03:25:47,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 03:25:47,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 6 letters. [2020-07-29 03:25:47,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:47,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:47,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:47,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:47,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:47,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:47,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:47,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:47,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:47,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 03:25:47,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 6 letters. [2020-07-29 03:25:47,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 6 letters. [2020-07-29 03:25:47,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:47,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:47,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:25:47,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:47,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:47,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:47,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:47,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:47,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:47,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:47,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:47,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:47,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:47,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:47,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:47,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:47,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:47,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:47,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:25:47,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:25:47,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:25:47,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:47,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:47,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:47,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:47,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:47,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:47,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:25:47,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:25:47,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:25:47,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:25:47,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:25:47,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:25:47,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:25:47,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:25:47,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:25:47,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:47,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:47,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:47,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:47,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:47,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:47,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:47,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:47,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 87 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:47,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,404 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-29 03:25:47,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:47,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:47,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 59 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:25:47,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:47,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 87 transitions. cyclomatic complexity: 34 [2020-07-29 03:25:47,425 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 03:25:47,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 27 transitions. [2020-07-29 03:25:47,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:47,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:25:47,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-07-29 03:25:47,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:47,435 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-07-29 03:25:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-07-29 03:25:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-29 03:25:47,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:47,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 transitions. Second operand 20 states. [2020-07-29 03:25:47,468 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 transitions. Second operand 20 states. [2020-07-29 03:25:47,470 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 20 states. [2020-07-29 03:25:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:47,482 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2020-07-29 03:25:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2020-07-29 03:25:47,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:47,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:47,483 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states and 27 transitions. [2020-07-29 03:25:47,483 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states and 27 transitions. [2020-07-29 03:25:47,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:47,485 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2020-07-29 03:25:47,485 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2020-07-29 03:25:47,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:47,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:47,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:47,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:25:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2020-07-29 03:25:47,489 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-07-29 03:25:47,489 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-07-29 03:25:47,489 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:47,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2020-07-29 03:25:47,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 03:25:47,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:47,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:47,492 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:47,492 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:47,492 INFO L794 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 179#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 180#L532 assume !(main_~length1~0 < 1); 181#L532-2 assume !(main_~length2~0 < 1); 175#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 176#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 172#L541-4 main_~i~1 := 0; 173#L546-3 [2020-07-29 03:25:47,492 INFO L796 eck$LassoCheckResult]: Loop: 173#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 177#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 173#L546-3 [2020-07-29 03:25:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:47,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-07-29 03:25:47,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:47,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669090917] [2020-07-29 03:25:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:47,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:47,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:47,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:47,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-07-29 03:25:47,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:47,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031984288] [2020-07-29 03:25:47,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:47,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:47,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:47,576 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:47,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2020-07-29 03:25:47,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:47,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622429914] [2020-07-29 03:25:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:47,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:47,605 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:47,609 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:47,800 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-07-29 03:25:47,882 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:47,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:47,882 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:47,882 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:47,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:47,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:47,883 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:47,883 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration2_Lasso [2020-07-29 03:25:47,883 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:47,883 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:47,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:48,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:48,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:48,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:48,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:48,639 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:48,641 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:48,649 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 [2020-07-29 03:25:48,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,682 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 [2020-07-29 03:25:48,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,713 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 [2020-07-29 03:25:48,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,746 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 [2020-07-29 03:25:48,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:48,801 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 [2020-07-29 03:25:48,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:48,854 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 [2020-07-29 03:25:48,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,897 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 [2020-07-29 03:25:48,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:48,927 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 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,931 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,953 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 [2020-07-29 03:25:48,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,997 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 [2020-07-29 03:25:48,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:49,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:49,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:49,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:49,031 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 [2020-07-29 03:25:49,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:49,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:49,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:49,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:49,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:49,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:49,058 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:49,094 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-07-29 03:25:49,095 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:49,099 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:49,101 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:49,101 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:49,101 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0.offset >= 0] [2020-07-29 03:25:49,155 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2020-07-29 03:25:49,169 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17;" "main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16;" [2020-07-29 03:25:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:25:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:49,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {237#unseeded} is VALID [2020-07-29 03:25:49,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {237#unseeded} is VALID [2020-07-29 03:25:49,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#unseeded} assume !(main_~length1~0 < 1); {237#unseeded} is VALID [2020-07-29 03:25:49,276 INFO L280 TraceCheckUtils]: 3: Hoare triple {237#unseeded} assume !(main_~length2~0 < 1); {237#unseeded} is VALID [2020-07-29 03:25:49,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {237#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {287#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:25:49,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {287#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~0 < main_~length1~0 - 1); {287#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:25:49,279 INFO L280 TraceCheckUtils]: 6: Hoare triple {287#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_~i~1 := 0; {287#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:25:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,285 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:25:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:49,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {288#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_main_~i~1))) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {314#(and (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (<= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_main_~i~1)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:25:49,320 INFO L280 TraceCheckUtils]: 1: Hoare triple {314#(and (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (<= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_main_~i~1)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {290#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (* (- 1) ULTIMATE.start_main_~i~1))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:25:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:49,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:49,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:49,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:49,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,342 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:25:49,343 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2020-07-29 03:25:49,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 31 states and 44 transitions. Complement of second has 7 states. [2020-07-29 03:25:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:49,563 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:49,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. cyclomatic complexity: 10 [2020-07-29 03:25:49,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:25:49,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:49,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2020-07-29 03:25:49,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 03:25:49,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,570 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 27 transitions. cyclomatic complexity: 10 [2020-07-29 03:25:49,578 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 03:25:49,579 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:25:49,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:49,580 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:49,581 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 03:25:49,582 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:25:49,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:49,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:49,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:49,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:49,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:49,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:49,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:49,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:49,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:49,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:25:49,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:25:49,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:25:49,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:49,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:49,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:49,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:49,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:49,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:49,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:49,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:49,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:49,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:49,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:49,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:49,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:25:49,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:25:49,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:25:49,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:25:49,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:25:49,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:25:49,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:49,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:49,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:49,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:25:49,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:25:49,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:25:49,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:49,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:49,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:49,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:25:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:25:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:25:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:49,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:49,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:49,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:49,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:49,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:25:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:25:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:25:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:25:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:25:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:25:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:25:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:25:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:25:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:25:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:49,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 8 letters. [2020-07-29 03:25:49,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:25:49,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:25:49,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:25:49,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:49,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:49,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:25:49,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:49,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:49,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 44 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:25:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,609 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:25:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 03:25:49,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:49,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:49,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:25:49,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. cyclomatic complexity: 17 [2020-07-29 03:25:49,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 03:25:49,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 29 transitions. [2020-07-29 03:25:49,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:25:49,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:49,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2020-07-29 03:25:49,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:49,615 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-07-29 03:25:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2020-07-29 03:25:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-29 03:25:49,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:49,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 29 transitions. Second operand 21 states. [2020-07-29 03:25:49,617 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 29 transitions. Second operand 21 states. [2020-07-29 03:25:49,618 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 21 states. [2020-07-29 03:25:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:49,619 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-29 03:25:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2020-07-29 03:25:49,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:49,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:49,620 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states and 29 transitions. [2020-07-29 03:25:49,620 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states and 29 transitions. [2020-07-29 03:25:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:49,621 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-29 03:25:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2020-07-29 03:25:49,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:49,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:49,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:49,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 03:25:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-07-29 03:25:49,623 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-07-29 03:25:49,623 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-07-29 03:25:49,623 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:49,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2020-07-29 03:25:49,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 03:25:49,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,624 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:49,624 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:49,625 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 373#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 374#L532 assume !(main_~length1~0 < 1); 375#L532-2 assume !(main_~length2~0 < 1); 368#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 369#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 365#L541-4 main_~i~1 := 0; 366#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 372#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 364#L519-4 [2020-07-29 03:25:49,625 INFO L796 eck$LassoCheckResult]: Loop: 364#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 367#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 379#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 376#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 377#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; 361#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 362#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 363#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 364#L519-4 [2020-07-29 03:25:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2020-07-29 03:25:49,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:49,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101474511] [2020-07-29 03:25:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,665 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 1 times [2020-07-29 03:25:49,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:49,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581156981] [2020-07-29 03:25:49,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1903570310, now seen corresponding path program 1 times [2020-07-29 03:25:49,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:49,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027169544] [2020-07-29 03:25:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:50,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {431#true} is VALID [2020-07-29 03:25:50,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {431#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {431#true} is VALID [2020-07-29 03:25:50,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {431#true} assume !(main_~length1~0 < 1); {433#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:50,035 INFO L280 TraceCheckUtils]: 3: Hoare triple {433#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 1); {433#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:50,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {433#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {434#(and (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:25:50,038 INFO L280 TraceCheckUtils]: 5: Hoare triple {434#(and (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} assume !(main_~i~0 < main_~length1~0 - 1); {435#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:50,038 INFO L280 TraceCheckUtils]: 6: Hoare triple {435#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_~i~1 := 0; {435#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:50,039 INFO L280 TraceCheckUtils]: 7: Hoare triple {435#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~1 < main_~length2~0 - 1); {435#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:50,041 INFO L280 TraceCheckUtils]: 8: Hoare triple {435#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {436#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} is VALID [2020-07-29 03:25:50,042 INFO L280 TraceCheckUtils]: 9: Hoare triple {436#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {436#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} is VALID [2020-07-29 03:25:50,043 INFO L280 TraceCheckUtils]: 10: Hoare triple {436#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {437#(= 0 ULTIMATE.start_cstrspn_~c~0)} is VALID [2020-07-29 03:25:50,044 INFO L280 TraceCheckUtils]: 11: Hoare triple {437#(= 0 ULTIMATE.start_cstrspn_~c~0)} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {438#(or (not |ULTIMATE.start_cstrspn_#t~short7|) (not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))))} is VALID [2020-07-29 03:25:50,045 INFO L280 TraceCheckUtils]: 12: Hoare triple {438#(or (not |ULTIMATE.start_cstrspn_#t~short7|) (not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {439#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:50,045 INFO L280 TraceCheckUtils]: 13: Hoare triple {439#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {439#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:50,046 INFO L280 TraceCheckUtils]: 14: Hoare triple {439#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {440#(not (= |ULTIMATE.start_cstrspn_#t~mem9| ULTIMATE.start_cstrspn_~c~0))} is VALID [2020-07-29 03:25:50,047 INFO L280 TraceCheckUtils]: 15: Hoare triple {440#(not (= |ULTIMATE.start_cstrspn_#t~mem9| ULTIMATE.start_cstrspn_~c~0))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {432#false} is VALID [2020-07-29 03:25:50,047 INFO L280 TraceCheckUtils]: 16: Hoare triple {432#false} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {432#false} is VALID [2020-07-29 03:25:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:50,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027169544] [2020-07-29 03:25:50,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:50,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 03:25:50,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824191156] [2020-07-29 03:25:50,207 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-07-29 03:25:50,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:50,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:25:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:25:50,299 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand 10 states. [2020-07-29 03:25:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,002 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2020-07-29 03:25:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-29 03:25:51,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:25:51,031 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:51,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2020-07-29 03:25:51,034 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2020-07-29 03:25:51,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 48 states and 64 transitions. [2020-07-29 03:25:51,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-07-29 03:25:51,037 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-07-29 03:25:51,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 64 transitions. [2020-07-29 03:25:51,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:51,038 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 64 transitions. [2020-07-29 03:25:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 64 transitions. [2020-07-29 03:25:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2020-07-29 03:25:51,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:51,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states and 64 transitions. Second operand 32 states. [2020-07-29 03:25:51,045 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states and 64 transitions. Second operand 32 states. [2020-07-29 03:25:51,045 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand 32 states. [2020-07-29 03:25:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,048 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2020-07-29 03:25:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2020-07-29 03:25:51,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,049 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 48 states and 64 transitions. [2020-07-29 03:25:51,050 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 48 states and 64 transitions. [2020-07-29 03:25:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,054 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2020-07-29 03:25:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2020-07-29 03:25:51,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:51,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 03:25:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2020-07-29 03:25:51,057 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-07-29 03:25:51,057 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2020-07-29 03:25:51,057 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:51,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2020-07-29 03:25:51,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 03:25:51,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:51,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:51,060 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:51,060 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:51,060 INFO L794 eck$LassoCheckResult]: Stem: 526#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 520#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 521#L532 assume !(main_~length1~0 < 1); 522#L532-2 assume !(main_~length2~0 < 1); 514#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 515#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 532#L541-4 main_~i~1 := 0; 518#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 519#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 536#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 535#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 528#L522-5 [2020-07-29 03:25:51,060 INFO L796 eck$LassoCheckResult]: Loop: 528#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 533#L522-1 assume !cstrspn_#t~short7; 534#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 528#L522-5 [2020-07-29 03:25:51,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 1 times [2020-07-29 03:25:51,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040015466] [2020-07-29 03:25:51,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {638#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {638#true} is VALID [2020-07-29 03:25:51,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {638#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {638#true} is VALID [2020-07-29 03:25:51,236 INFO L280 TraceCheckUtils]: 2: Hoare triple {638#true} assume !(main_~length1~0 < 1); {640#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:51,236 INFO L280 TraceCheckUtils]: 3: Hoare triple {640#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 1); {640#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:51,238 INFO L280 TraceCheckUtils]: 4: Hoare triple {640#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {641#(and (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:25:51,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {641#(and (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} assume !(main_~i~0 < main_~length1~0 - 1); {642#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:51,240 INFO L280 TraceCheckUtils]: 6: Hoare triple {642#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_~i~1 := 0; {642#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:51,241 INFO L280 TraceCheckUtils]: 7: Hoare triple {642#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~1 < main_~length2~0 - 1); {642#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:51,242 INFO L280 TraceCheckUtils]: 8: Hoare triple {642#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {643#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} is VALID [2020-07-29 03:25:51,243 INFO L280 TraceCheckUtils]: 9: Hoare triple {643#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {644#(= 0 |ULTIMATE.start_cstrspn_#t~mem3|)} is VALID [2020-07-29 03:25:51,244 INFO L280 TraceCheckUtils]: 10: Hoare triple {644#(= 0 |ULTIMATE.start_cstrspn_#t~mem3|)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {639#false} is VALID [2020-07-29 03:25:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:51,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040015466] [2020-07-29 03:25:51,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:51,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 03:25:51,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883093253] [2020-07-29 03:25:51,246 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:51,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,246 INFO L82 PathProgramCache]: Analyzing trace with hash 86558, now seen corresponding path program 1 times [2020-07-29 03:25:51,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212620693] [2020-07-29 03:25:51,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {645#true} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {645#true} is VALID [2020-07-29 03:25:51,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {645#true} assume !cstrspn_#t~short7; {647#(not |ULTIMATE.start_cstrspn_#t~short7|)} is VALID [2020-07-29 03:25:51,261 INFO L280 TraceCheckUtils]: 2: Hoare triple {647#(not |ULTIMATE.start_cstrspn_#t~short7|)} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {646#false} is VALID [2020-07-29 03:25:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:51,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212620693] [2020-07-29 03:25:51,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:51,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:25:51,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871565570] [2020-07-29 03:25:51,262 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:25:51,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:51,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:25:51,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:25:51,263 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand 3 states. [2020-07-29 03:25:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,315 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-07-29 03:25:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:25:51,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:51,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:51,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2020-07-29 03:25:51,325 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 03:25:51,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 44 transitions. [2020-07-29 03:25:51,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-07-29 03:25:51,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-07-29 03:25:51,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2020-07-29 03:25:51,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:51,327 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-29 03:25:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2020-07-29 03:25:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-29 03:25:51,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:51,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 44 transitions. Second operand 32 states. [2020-07-29 03:25:51,330 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 44 transitions. Second operand 32 states. [2020-07-29 03:25:51,330 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 32 states. [2020-07-29 03:25:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,332 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-07-29 03:25:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-07-29 03:25:51,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,332 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states and 44 transitions. [2020-07-29 03:25:51,333 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states and 44 transitions. [2020-07-29 03:25:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,334 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-07-29 03:25:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-07-29 03:25:51,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:51,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 03:25:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-07-29 03:25:51,341 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-07-29 03:25:51,341 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-07-29 03:25:51,341 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:51,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2020-07-29 03:25:51,342 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 03:25:51,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:51,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:51,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:51,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:25:51,343 INFO L794 eck$LassoCheckResult]: Stem: 701#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 695#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 696#L532 assume !(main_~length1~0 < 1); 697#L532-2 assume !(main_~length2~0 < 1); 689#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 690#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 685#L541-4 main_~i~1 := 0; 686#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 710#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 687#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 688#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 702#L522-5 [2020-07-29 03:25:51,343 INFO L796 eck$LassoCheckResult]: Loop: 702#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 698#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 699#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 702#L522-5 [2020-07-29 03:25:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2087759941, now seen corresponding path program 2 times [2020-07-29 03:25:51,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208948831] [2020-07-29 03:25:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:51,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {782#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {782#true} is VALID [2020-07-29 03:25:51,547 INFO L280 TraceCheckUtils]: 1: Hoare triple {782#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {782#true} is VALID [2020-07-29 03:25:51,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {782#true} assume !(main_~length1~0 < 1); {784#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:51,549 INFO L280 TraceCheckUtils]: 3: Hoare triple {784#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 1); {784#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:51,551 INFO L280 TraceCheckUtils]: 4: Hoare triple {784#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {785#(and (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:25:51,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {785#(and (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} assume !(main_~i~0 < main_~length1~0 - 1); {786#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:51,553 INFO L280 TraceCheckUtils]: 6: Hoare triple {786#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_~i~1 := 0; {786#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:51,554 INFO L280 TraceCheckUtils]: 7: Hoare triple {786#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~1 < main_~length2~0 - 1); {786#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:51,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {786#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {787#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} is VALID [2020-07-29 03:25:51,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {787#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {788#(= 0 |ULTIMATE.start_cstrspn_#t~mem3|)} is VALID [2020-07-29 03:25:51,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {788#(= 0 |ULTIMATE.start_cstrspn_#t~mem3|)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {783#false} is VALID [2020-07-29 03:25:51,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:51,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208948831] [2020-07-29 03:25:51,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:51,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 03:25:51,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489729884] [2020-07-29 03:25:51,561 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:51,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,561 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 1 times [2020-07-29 03:25:51,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834850026] [2020-07-29 03:25:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:51,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:51,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:25:51,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:25:51,691 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand 7 states. [2020-07-29 03:25:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,945 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-29 03:25:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:25:51,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:25:51,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:51,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2020-07-29 03:25:51,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 03:25:51,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 23 states and 30 transitions. [2020-07-29 03:25:51,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 03:25:51,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 03:25:51,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2020-07-29 03:25:51,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:51,964 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-07-29 03:25:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2020-07-29 03:25:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-29 03:25:51,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:51,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 30 transitions. Second operand 22 states. [2020-07-29 03:25:51,966 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 30 transitions. Second operand 22 states. [2020-07-29 03:25:51,966 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 22 states. [2020-07-29 03:25:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,967 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 03:25:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-07-29 03:25:51,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,968 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states and 30 transitions. [2020-07-29 03:25:51,968 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states and 30 transitions. [2020-07-29 03:25:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:51,969 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2020-07-29 03:25:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-07-29 03:25:51,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:51,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:51,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:51,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 03:25:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-07-29 03:25:51,971 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-07-29 03:25:51,971 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-07-29 03:25:51,971 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:25:51,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2020-07-29 03:25:51,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 03:25:51,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:51,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:51,972 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:51,972 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:51,972 INFO L794 eck$LassoCheckResult]: Stem: 843#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 837#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 838#L532 assume !(main_~length1~0 < 1); 839#L532-2 assume !(main_~length2~0 < 1); 832#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 833#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 845#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 846#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 829#L541-4 main_~i~1 := 0; 830#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 836#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 828#L519-4 [2020-07-29 03:25:51,972 INFO L796 eck$LassoCheckResult]: Loop: 828#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 831#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 844#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 840#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 841#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; 825#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 826#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 827#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 828#L519-4 [2020-07-29 03:25:51,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-07-29 03:25:51,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091269481] [2020-07-29 03:25:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:51,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:51,998 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:51,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:51,999 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 2 times [2020-07-29 03:25:51,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:51,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955363902] [2020-07-29 03:25:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,006 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,013 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash -164170776, now seen corresponding path program 1 times [2020-07-29 03:25:52,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:52,015 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818945472] [2020-07-29 03:25:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:52,254 INFO L280 TraceCheckUtils]: 0: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {900#true} is VALID [2020-07-29 03:25:52,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {900#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {900#true} is VALID [2020-07-29 03:25:52,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {900#true} assume !(main_~length1~0 < 1); {900#true} is VALID [2020-07-29 03:25:52,255 INFO L280 TraceCheckUtils]: 3: Hoare triple {900#true} assume !(main_~length2~0 < 1); {902#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:52,257 INFO L280 TraceCheckUtils]: 4: Hoare triple {902#(<= 1 ULTIMATE.start_main_~length2~0)} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {903#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:52,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {903#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {903#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:52,259 INFO L280 TraceCheckUtils]: 6: Hoare triple {903#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {903#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:52,260 INFO L280 TraceCheckUtils]: 7: Hoare triple {903#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {903#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:52,261 INFO L280 TraceCheckUtils]: 8: Hoare triple {903#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {904#(and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:52,262 INFO L280 TraceCheckUtils]: 9: Hoare triple {904#(and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {905#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:52,263 INFO L280 TraceCheckUtils]: 10: Hoare triple {905#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {906#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_cstrspn_~s2.offset))} is VALID [2020-07-29 03:25:52,264 INFO L280 TraceCheckUtils]: 11: Hoare triple {906#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_cstrspn_~s2.offset))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {907#(and (= |ULTIMATE.start_cstrspn_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_cstrspn_~s2.offset)))} is VALID [2020-07-29 03:25:52,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {907#(and (= |ULTIMATE.start_cstrspn_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_cstrspn_~s2.offset)))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {908#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:52,265 INFO L280 TraceCheckUtils]: 13: Hoare triple {908#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {908#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:52,265 INFO L280 TraceCheckUtils]: 14: Hoare triple {908#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {908#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:52,266 INFO L280 TraceCheckUtils]: 15: Hoare triple {908#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {908#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:52,266 INFO L280 TraceCheckUtils]: 16: Hoare triple {908#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {909#(not (= |ULTIMATE.start_cstrspn_#t~mem9| ULTIMATE.start_cstrspn_~c~0))} is VALID [2020-07-29 03:25:52,267 INFO L280 TraceCheckUtils]: 17: Hoare triple {909#(not (= |ULTIMATE.start_cstrspn_#t~mem9| ULTIMATE.start_cstrspn_~c~0))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {901#false} is VALID [2020-07-29 03:25:52,267 INFO L280 TraceCheckUtils]: 18: Hoare triple {901#false} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {901#false} is VALID [2020-07-29 03:25:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:25:52,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818945472] [2020-07-29 03:25:52,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:52,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-29 03:25:52,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165284419] [2020-07-29 03:25:52,428 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-07-29 03:25:52,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:25:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:25:52,516 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 10 Second operand 10 states. [2020-07-29 03:25:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:53,107 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-29 03:25:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:25:53,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:25:53,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:53,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2020-07-29 03:25:53,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-07-29 03:25:53,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 36 states and 45 transitions. [2020-07-29 03:25:53,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-07-29 03:25:53,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-07-29 03:25:53,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2020-07-29 03:25:53,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:53,139 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2020-07-29 03:25:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2020-07-29 03:25:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-29 03:25:53,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:53,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 45 transitions. Second operand 35 states. [2020-07-29 03:25:53,144 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 45 transitions. Second operand 35 states. [2020-07-29 03:25:53,144 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand 35 states. [2020-07-29 03:25:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:53,146 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-29 03:25:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2020-07-29 03:25:53,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:53,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:53,148 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states and 45 transitions. [2020-07-29 03:25:53,148 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states and 45 transitions. [2020-07-29 03:25:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:53,151 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-29 03:25:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2020-07-29 03:25:53,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:53,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:53,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:53,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 03:25:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2020-07-29 03:25:53,155 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-07-29 03:25:53,155 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2020-07-29 03:25:53,155 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:25:53,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 44 transitions. [2020-07-29 03:25:53,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-07-29 03:25:53,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:53,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:53,156 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:53,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:53,157 INFO L794 eck$LassoCheckResult]: Stem: 980#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 974#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 975#L532 assume !(main_~length1~0 < 1); 976#L532-2 assume !(main_~length2~0 < 1); 968#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 969#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 985#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 986#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 963#L541-4 main_~i~1 := 0; 964#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 972#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 962#L519-4 [2020-07-29 03:25:53,157 INFO L796 eck$LassoCheckResult]: Loop: 962#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 965#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 989#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 988#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 981#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 982#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 993#L522-1 assume !cstrspn_#t~short7; 992#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; 959#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 960#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 961#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 962#L519-4 [2020-07-29 03:25:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 2 times [2020-07-29 03:25:53,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:53,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365574073] [2020-07-29 03:25:53,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:53,175 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:53,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:53,199 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:53,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash -896438552, now seen corresponding path program 1 times [2020-07-29 03:25:53,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:53,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625319317] [2020-07-29 03:25:53,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:53,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {1071#true} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1073#(= |ULTIMATE.start_cstrspn_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} is VALID [2020-07-29 03:25:53,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {1073#(= |ULTIMATE.start_cstrspn_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1074#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} is VALID [2020-07-29 03:25:53,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {1074#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1074#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} is VALID [2020-07-29 03:25:53,262 INFO L280 TraceCheckUtils]: 3: Hoare triple {1074#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1074#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} is VALID [2020-07-29 03:25:53,263 INFO L280 TraceCheckUtils]: 4: Hoare triple {1074#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {1074#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} is VALID [2020-07-29 03:25:53,264 INFO L280 TraceCheckUtils]: 5: Hoare triple {1074#(not (= 0 ULTIMATE.start_cstrspn_~c~0))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1075#(or (not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))) |ULTIMATE.start_cstrspn_#t~short7|)} is VALID [2020-07-29 03:25:53,265 INFO L280 TraceCheckUtils]: 6: Hoare triple {1075#(or (not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))) |ULTIMATE.start_cstrspn_#t~short7|)} assume !cstrspn_#t~short7; {1076#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:53,265 INFO L280 TraceCheckUtils]: 7: Hoare triple {1076#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {1076#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:53,266 INFO L280 TraceCheckUtils]: 8: Hoare triple {1076#(not (= ULTIMATE.start_cstrspn_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {1077#(not (= |ULTIMATE.start_cstrspn_#t~mem9| ULTIMATE.start_cstrspn_~c~0))} is VALID [2020-07-29 03:25:53,267 INFO L280 TraceCheckUtils]: 9: Hoare triple {1077#(not (= |ULTIMATE.start_cstrspn_#t~mem9| ULTIMATE.start_cstrspn_~c~0))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {1072#false} is VALID [2020-07-29 03:25:53,267 INFO L280 TraceCheckUtils]: 10: Hoare triple {1072#false} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {1072#false} is VALID [2020-07-29 03:25:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:25:53,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625319317] [2020-07-29 03:25:53,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722956615] [2020-07-29 03:25:53,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:53,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-29 03:25:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:53,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:53,610 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:53,611 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2020-07-29 03:25:53,614 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:53,632 INFO L624 ElimStorePlain]: treesize reduction 3, result has 85.0 percent of original size [2020-07-29 03:25:53,645 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:53,645 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:8 [2020-07-29 03:25:53,648 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:53,648 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~s~0.offset]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset)) (.cse1 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))) (and (not (= 0 .cse0)) (= .cse0 ULTIMATE.start_cstrspn_~c~0) (= |ULTIMATE.start_cstrspn_#t~mem9| .cse1) (= 0 .cse1))) [2020-07-29 03:25:53,648 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |ULTIMATE.start_cstrspn_#t~mem9|) (not (= 0 ULTIMATE.start_cstrspn_~c~0))) [2020-07-29 03:25:53,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {1071#true} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1073#(= |ULTIMATE.start_cstrspn_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} is VALID [2020-07-29 03:25:53,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {1073#(= |ULTIMATE.start_cstrspn_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1084#(exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))} is VALID [2020-07-29 03:25:53,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {1084#(exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1084#(exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))} is VALID [2020-07-29 03:25:53,676 INFO L280 TraceCheckUtils]: 3: Hoare triple {1084#(exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1084#(exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))} is VALID [2020-07-29 03:25:53,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {1084#(exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {1084#(exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))} is VALID [2020-07-29 03:25:53,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {1084#(exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1097#(or (and (not |ULTIMATE.start_cstrspn_#t~short7|) (exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))) |ULTIMATE.start_cstrspn_#t~short7| (exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))))} is VALID [2020-07-29 03:25:53,680 INFO L280 TraceCheckUtils]: 6: Hoare triple {1097#(or (and (not |ULTIMATE.start_cstrspn_#t~short7|) (exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset))) |ULTIMATE.start_cstrspn_#t~short7| (exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0)))))} assume !cstrspn_#t~short7; {1101#(and (exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:53,681 INFO L280 TraceCheckUtils]: 7: Hoare triple {1101#(and (exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {1101#(and (exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} is VALID [2020-07-29 03:25:53,682 INFO L280 TraceCheckUtils]: 8: Hoare triple {1101#(and (exists ((ULTIMATE.start_cstrspn_~sc1~0.base Int) (ULTIMATE.start_cstrspn_~sc1~0.offset Int)) (and (not (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset))) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset) ULTIMATE.start_cstrspn_~c~0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {1108#(and (= 0 |ULTIMATE.start_cstrspn_#t~mem9|) (not (= 0 ULTIMATE.start_cstrspn_~c~0)))} is VALID [2020-07-29 03:25:53,682 INFO L280 TraceCheckUtils]: 9: Hoare triple {1108#(and (= 0 |ULTIMATE.start_cstrspn_#t~mem9|) (not (= 0 ULTIMATE.start_cstrspn_~c~0)))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {1072#false} is VALID [2020-07-29 03:25:53,683 INFO L280 TraceCheckUtils]: 10: Hoare triple {1072#false} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {1072#false} is VALID [2020-07-29 03:25:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:25:53,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 03:25:53,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2020-07-29 03:25:53,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078263766] [2020-07-29 03:25:53,685 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:25:53,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:53,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:25:53,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-29 03:25:53,685 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. cyclomatic complexity: 13 Second operand 7 states. [2020-07-29 03:25:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:54,048 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2020-07-29 03:25:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:25:54,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:25:54,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:54,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 50 transitions. [2020-07-29 03:25:54,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-07-29 03:25:54,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 44 transitions. [2020-07-29 03:25:54,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-07-29 03:25:54,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-07-29 03:25:54,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 44 transitions. [2020-07-29 03:25:54,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:54,072 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2020-07-29 03:25:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 44 transitions. [2020-07-29 03:25:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2020-07-29 03:25:54,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:54,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 44 transitions. Second operand 33 states. [2020-07-29 03:25:54,076 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 44 transitions. Second operand 33 states. [2020-07-29 03:25:54,076 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 33 states. [2020-07-29 03:25:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:54,077 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-29 03:25:54,077 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-29 03:25:54,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:54,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:54,078 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states and 44 transitions. [2020-07-29 03:25:54,078 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states and 44 transitions. [2020-07-29 03:25:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:54,079 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-29 03:25:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-29 03:25:54,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:54,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:54,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:54,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:25:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2020-07-29 03:25:54,081 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-29 03:25:54,081 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2020-07-29 03:25:54,081 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:25:54,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2020-07-29 03:25:54,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-07-29 03:25:54,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:54,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:54,082 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:54,082 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:54,082 INFO L794 eck$LassoCheckResult]: Stem: 1179#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1174#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1175#L532 assume !(main_~length1~0 < 1); 1176#L532-2 assume !(main_~length2~0 < 1); 1168#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1169#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1183#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1184#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1165#L541-4 main_~i~1 := 0; 1166#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1172#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1188#L519-4 [2020-07-29 03:25:54,082 INFO L796 eck$LassoCheckResult]: Loop: 1188#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1187#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1186#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1185#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1180#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1181#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1193#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1192#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; 1191#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1190#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1189#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1188#L519-4 [2020-07-29 03:25:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:54,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 3 times [2020-07-29 03:25:54,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:54,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464556315] [2020-07-29 03:25:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:54,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:54,100 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:54,104 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:54,105 INFO L82 PathProgramCache]: Analyzing trace with hash -898285594, now seen corresponding path program 1 times [2020-07-29 03:25:54,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:54,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670842217] [2020-07-29 03:25:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:54,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:54,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:54,121 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:54,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:54,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1809250353, now seen corresponding path program 1 times [2020-07-29 03:25:54,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:54,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663019513] [2020-07-29 03:25:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:54,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {1275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1275#true} is VALID [2020-07-29 03:25:54,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {1275#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {1275#true} is VALID [2020-07-29 03:25:54,240 INFO L280 TraceCheckUtils]: 2: Hoare triple {1275#true} assume !(main_~length1~0 < 1); {1275#true} is VALID [2020-07-29 03:25:54,240 INFO L280 TraceCheckUtils]: 3: Hoare triple {1275#true} assume !(main_~length2~0 < 1); {1275#true} is VALID [2020-07-29 03:25:54,242 INFO L280 TraceCheckUtils]: 4: Hoare triple {1275#true} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {1277#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:54,243 INFO L280 TraceCheckUtils]: 5: Hoare triple {1277#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {1277#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:54,245 INFO L280 TraceCheckUtils]: 6: Hoare triple {1277#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {1277#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:54,246 INFO L280 TraceCheckUtils]: 7: Hoare triple {1277#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {1277#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:54,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {1277#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {1278#(and (= 0 ULTIMATE.start_main_~i~1) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:54,252 INFO L280 TraceCheckUtils]: 9: Hoare triple {1278#(and (= 0 ULTIMATE.start_main_~i~1) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {1279#(and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:54,253 INFO L280 TraceCheckUtils]: 10: Hoare triple {1279#(and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {1280#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) 1) (= 0 ULTIMATE.start_cstrspn_~s2.offset))} is VALID [2020-07-29 03:25:54,254 INFO L280 TraceCheckUtils]: 11: Hoare triple {1280#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) 1) (= 0 ULTIMATE.start_cstrspn_~s2.offset))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1280#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) 1) (= 0 ULTIMATE.start_cstrspn_~s2.offset))} is VALID [2020-07-29 03:25:54,255 INFO L280 TraceCheckUtils]: 12: Hoare triple {1280#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) 1) (= 0 ULTIMATE.start_cstrspn_~s2.offset))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1281#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1) (= 0 ULTIMATE.start_cstrspn_~s~0.offset))} is VALID [2020-07-29 03:25:54,255 INFO L280 TraceCheckUtils]: 13: Hoare triple {1281#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1) (= 0 ULTIMATE.start_cstrspn_~s~0.offset))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1281#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1) (= 0 ULTIMATE.start_cstrspn_~s~0.offset))} is VALID [2020-07-29 03:25:54,256 INFO L280 TraceCheckUtils]: 14: Hoare triple {1281#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1) (= 0 ULTIMATE.start_cstrspn_~s~0.offset))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1281#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1) (= 0 ULTIMATE.start_cstrspn_~s~0.offset))} is VALID [2020-07-29 03:25:54,257 INFO L280 TraceCheckUtils]: 15: Hoare triple {1281#(and (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1) (= 0 ULTIMATE.start_cstrspn_~s~0.offset))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {1282#(<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)} is VALID [2020-07-29 03:25:54,258 INFO L280 TraceCheckUtils]: 16: Hoare triple {1282#(<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) ULTIMATE.start_cstrspn_~s~0.offset)} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1276#false} is VALID [2020-07-29 03:25:54,259 INFO L280 TraceCheckUtils]: 17: Hoare triple {1276#false} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1276#false} is VALID [2020-07-29 03:25:54,259 INFO L280 TraceCheckUtils]: 18: Hoare triple {1276#false} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {1276#false} is VALID [2020-07-29 03:25:54,259 INFO L280 TraceCheckUtils]: 19: Hoare triple {1276#false} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {1276#false} is VALID [2020-07-29 03:25:54,260 INFO L280 TraceCheckUtils]: 20: Hoare triple {1276#false} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {1276#false} is VALID [2020-07-29 03:25:54,260 INFO L280 TraceCheckUtils]: 21: Hoare triple {1276#false} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {1276#false} is VALID [2020-07-29 03:25:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:25:54,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663019513] [2020-07-29 03:25:54,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083810801] [2020-07-29 03:25:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:54,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 03:25:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:54,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:54,358 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:54,359 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 03:25:54,359 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:54,372 INFO L624 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2020-07-29 03:25:54,374 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:54,374 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:5 [2020-07-29 03:25:54,376 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:54,376 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_61|, |ULTIMATE.start_main_#t~malloc12.base|, ULTIMATE.start_main_~length1~0]. (= (store (store |v_#length_61| |ULTIMATE.start_main_#t~malloc12.base| ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_main_~length2~0) |#length|) [2020-07-29 03:25:54,377 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) [2020-07-29 03:25:54,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {1275#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1275#true} is VALID [2020-07-29 03:25:54,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {1275#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {1275#true} is VALID [2020-07-29 03:25:54,594 INFO L280 TraceCheckUtils]: 2: Hoare triple {1275#true} assume !(main_~length1~0 < 1); {1275#true} is VALID [2020-07-29 03:25:54,595 INFO L280 TraceCheckUtils]: 3: Hoare triple {1275#true} assume !(main_~length2~0 < 1); {1275#true} is VALID [2020-07-29 03:25:54,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {1275#true} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {1298#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:54,596 INFO L280 TraceCheckUtils]: 5: Hoare triple {1298#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {1298#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:54,597 INFO L280 TraceCheckUtils]: 6: Hoare triple {1298#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {1298#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:54,600 INFO L280 TraceCheckUtils]: 7: Hoare triple {1298#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} assume !(main_~i~0 < main_~length1~0 - 1); {1298#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:54,600 INFO L280 TraceCheckUtils]: 8: Hoare triple {1298#(= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)} main_~i~1 := 0; {1311#(and (<= ULTIMATE.start_main_~i~1 0) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0))} is VALID [2020-07-29 03:25:54,601 INFO L280 TraceCheckUtils]: 9: Hoare triple {1311#(and (<= ULTIMATE.start_main_~i~1 0) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0))} assume !(main_~i~1 < main_~length2~0 - 1); {1315#(<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 1)} is VALID [2020-07-29 03:25:54,602 INFO L280 TraceCheckUtils]: 10: Hoare triple {1315#(<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 1)} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {1319#(<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) 1)} is VALID [2020-07-29 03:25:54,602 INFO L280 TraceCheckUtils]: 11: Hoare triple {1319#(<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) 1)} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1319#(<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) 1)} is VALID [2020-07-29 03:25:54,603 INFO L280 TraceCheckUtils]: 12: Hoare triple {1319#(<= (select |#length| ULTIMATE.start_cstrspn_~s2.base) 1)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1326#(<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1)} is VALID [2020-07-29 03:25:54,603 INFO L280 TraceCheckUtils]: 13: Hoare triple {1326#(<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1)} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1330#(and (<= 0 ULTIMATE.start_cstrspn_~s~0.offset) (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1))} is VALID [2020-07-29 03:25:54,604 INFO L280 TraceCheckUtils]: 14: Hoare triple {1330#(and (<= 0 ULTIMATE.start_cstrspn_~s~0.offset) (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1330#(and (<= 0 ULTIMATE.start_cstrspn_~s~0.offset) (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1))} is VALID [2020-07-29 03:25:54,605 INFO L280 TraceCheckUtils]: 15: Hoare triple {1330#(and (<= 0 ULTIMATE.start_cstrspn_~s~0.offset) (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {1337#(and (<= 1 ULTIMATE.start_cstrspn_~s~0.offset) (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1))} is VALID [2020-07-29 03:25:54,606 INFO L280 TraceCheckUtils]: 16: Hoare triple {1337#(and (<= 1 ULTIMATE.start_cstrspn_~s~0.offset) (<= (select |#length| ULTIMATE.start_cstrspn_~s~0.base) 1))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1276#false} is VALID [2020-07-29 03:25:54,606 INFO L280 TraceCheckUtils]: 17: Hoare triple {1276#false} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1276#false} is VALID [2020-07-29 03:25:54,606 INFO L280 TraceCheckUtils]: 18: Hoare triple {1276#false} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {1276#false} is VALID [2020-07-29 03:25:54,606 INFO L280 TraceCheckUtils]: 19: Hoare triple {1276#false} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {1276#false} is VALID [2020-07-29 03:25:54,606 INFO L280 TraceCheckUtils]: 20: Hoare triple {1276#false} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {1276#false} is VALID [2020-07-29 03:25:54,606 INFO L280 TraceCheckUtils]: 21: Hoare triple {1276#false} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {1276#false} is VALID [2020-07-29 03:25:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:25:54,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 03:25:54,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2020-07-29 03:25:54,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949824181] [2020-07-29 03:25:54,829 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2020-07-29 03:25:54,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:54,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:25:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2020-07-29 03:25:54,948 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. cyclomatic complexity: 11 Second operand 9 states. [2020-07-29 03:25:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:55,324 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-29 03:25:55,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:25:55,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:25:55,357 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:55,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2020-07-29 03:25:55,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 03:25:55,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 27 transitions. [2020-07-29 03:25:55,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:25:55,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:25:55,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2020-07-29 03:25:55,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:55,361 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-29 03:25:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2020-07-29 03:25:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-29 03:25:55,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:55,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 27 transitions. Second operand 21 states. [2020-07-29 03:25:55,363 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 27 transitions. Second operand 21 states. [2020-07-29 03:25:55,363 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 21 states. [2020-07-29 03:25:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:55,364 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-29 03:25:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-29 03:25:55,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:55,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:55,365 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states and 27 transitions. [2020-07-29 03:25:55,365 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states and 27 transitions. [2020-07-29 03:25:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:55,368 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-29 03:25:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-29 03:25:55,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:55,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:55,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:55,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 03:25:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2020-07-29 03:25:55,370 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-07-29 03:25:55,370 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-07-29 03:25:55,371 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:25:55,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2020-07-29 03:25:55,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 03:25:55,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:55,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:55,371 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:55,372 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:55,372 INFO L794 eck$LassoCheckResult]: Stem: 1409#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1404#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1405#L532 assume !(main_~length1~0 < 1); 1406#L532-2 assume !(main_~length2~0 < 1); 1399#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1400#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1411#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1412#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1396#L541-4 main_~i~1 := 0; 1397#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1401#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1402#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1403#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1395#L519-4 [2020-07-29 03:25:55,372 INFO L796 eck$LassoCheckResult]: Loop: 1395#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1398#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1410#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1407#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1408#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; 1392#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 1393#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 1394#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 1395#L519-4 [2020-07-29 03:25:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-07-29 03:25:55,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:55,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513145816] [2020-07-29 03:25:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,395 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash -904885455, now seen corresponding path program 3 times [2020-07-29 03:25:55,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:55,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444367489] [2020-07-29 03:25:55,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,405 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,407 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:55,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:55,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1875279350, now seen corresponding path program 1 times [2020-07-29 03:25:55,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:55,408 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133722065] [2020-07-29 03:25:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,424 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,443 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:55,575 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-07-29 03:25:56,618 WARN L193 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2020-07-29 03:25:56,973 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-07-29 03:25:56,976 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:56,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:56,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:56,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:56,976 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:56,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:56,977 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:56,977 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:56,977 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration9_Lasso [2020-07-29 03:25:56,977 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:56,977 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:57,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,659 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2020-07-29 03:25:57,901 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2020-07-29 03:25:57,904 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:57,904 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:57,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,634 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-07-29 03:25:58,997 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2020-07-29 03:25:59,189 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-29 03:25:59,411 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:59,411 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,422 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 [2020-07-29 03:25:59,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,430 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:59,467 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 [2020-07-29 03:25:59,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,503 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 [2020-07-29 03:25:59,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,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 [2020-07-29 03:25:59,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:59,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:59,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,561 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 [2020-07-29 03:25:59,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,609 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 [2020-07-29 03:25:59,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,636 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 [2020-07-29 03:25:59,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,662 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 [2020-07-29 03:25:59,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:59,690 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 [2020-07-29 03:25:59,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,722 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 [2020-07-29 03:25:59,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,749 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 [2020-07-29 03:25:59,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,775 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 [2020-07-29 03:25:59,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,777 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:59,777 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:59,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,802 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 [2020-07-29 03:25:59,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,829 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 [2020-07-29 03:25:59,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:59,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:59,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:59,833 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,858 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 [2020-07-29 03:25:59,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:59,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:59,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,888 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 [2020-07-29 03:25:59,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,889 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:25:59,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,899 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 03:25:59,900 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 03:25:59,925 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:59,972 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 [2020-07-29 03:25:59,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:59,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:59,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:59,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:59,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:59,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:59,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,010 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 [2020-07-29 03:26:00,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,054 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 [2020-07-29 03:26:00,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,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 [2020-07-29 03:26:00,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,112 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 [2020-07-29 03:26:00,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:00,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:00,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:00,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:00,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,169 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 [2020-07-29 03:26:00,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:00,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:00,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:00,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:00,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:00,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:00,216 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:00,238 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 03:26:00,238 INFO L444 ModelExtractionUtils]: 58 out of 64 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:00,247 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:00,249 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:00,250 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:00,250 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~sc1~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3) = -1*ULTIMATE.start_cstrspn_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3 Supporting invariants [] [2020-07-29 03:26:00,360 INFO L297 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2020-07-29 03:26:00,365 INFO L393 LassoCheck]: Loop: "call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);" "assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4;" "call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5;" "assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256);" "assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;" "call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);" "assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9;" "cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;" [2020-07-29 03:26:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:00,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:00,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:00,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:00,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {1466#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1466#unseeded} is VALID [2020-07-29 03:26:00,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {1466#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {1466#unseeded} is VALID [2020-07-29 03:26:00,457 INFO L280 TraceCheckUtils]: 2: Hoare triple {1466#unseeded} assume !(main_~length1~0 < 1); {1466#unseeded} is VALID [2020-07-29 03:26:00,457 INFO L280 TraceCheckUtils]: 3: Hoare triple {1466#unseeded} assume !(main_~length2~0 < 1); {1466#unseeded} is VALID [2020-07-29 03:26:00,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {1466#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:00,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:00,460 INFO L280 TraceCheckUtils]: 6: Hoare triple {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:00,460 INFO L280 TraceCheckUtils]: 7: Hoare triple {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:00,461 INFO L280 TraceCheckUtils]: 8: Hoare triple {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} main_~i~1 := 0; {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:00,461 INFO L280 TraceCheckUtils]: 9: Hoare triple {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:00,462 INFO L280 TraceCheckUtils]: 10: Hoare triple {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:00,462 INFO L280 TraceCheckUtils]: 11: Hoare triple {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:00,463 INFO L280 TraceCheckUtils]: 12: Hoare triple {1596#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {1575#(and unseeded (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:00,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:26:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:00,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:00,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {1576#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~sc1~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|))) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:00,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:00,527 INFO L280 TraceCheckUtils]: 2: Hoare triple {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:00,528 INFO L280 TraceCheckUtils]: 3: Hoare triple {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:00,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:00,529 INFO L280 TraceCheckUtils]: 5: Hoare triple {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:00,530 INFO L280 TraceCheckUtils]: 6: Hoare triple {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:00,532 INFO L280 TraceCheckUtils]: 7: Hoare triple {1621#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ oldRank0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {1578#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~sc1~0.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrspn_~sc1~0.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:00,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:00,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:00,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 8 letters. [2020-07-29 03:26:00,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,557 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:26:00,557 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 03:26:00,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2020-07-29 03:26:00,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:00,671 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:00,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:00,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:00,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:00,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:00,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:00,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:00,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:00,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-07-29 03:26:00,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:00,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:00,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:00,677 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:00,678 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:26:00,678 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:00,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:00,685 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:00,685 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 03:26:00,686 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:00,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 8 letters. [2020-07-29 03:26:00,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 8 letters. [2020-07-29 03:26:00,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 8 letters. [2020-07-29 03:26:00,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:00,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:00,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:00,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:00,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:00,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:00,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:26:00,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:26:00,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:26:00,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:00,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:00,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:00,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:00,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:00,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:00,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:26:00,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:26:00,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:26:00,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:00,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:00,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:00,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:26:00,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:26:00,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:26:00,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:00,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:00,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:00,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:00,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:00,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:00,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 8 letters. [2020-07-29 03:26:00,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 8 letters. [2020-07-29 03:26:00,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 8 letters. [2020-07-29 03:26:00,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:26:00,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:26:00,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:26:00,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:00,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:00,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:00,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:00,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:00,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:00,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:00,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:00,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:00,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:00,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:00,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:00,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:00,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:00,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:00,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,708 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-29 03:26:00,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 03:26:00,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:00,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 13 letters. Loop has 16 letters. [2020-07-29 03:26:00,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:00,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. cyclomatic complexity: 11 [2020-07-29 03:26:00,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:00,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 33 transitions. [2020-07-29 03:26:00,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:26:00,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:26:00,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-07-29 03:26:00,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:00,712 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:26:00,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-07-29 03:26:00,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-29 03:26:00,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:00,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 33 transitions. Second operand 26 states. [2020-07-29 03:26:00,714 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 33 transitions. Second operand 26 states. [2020-07-29 03:26:00,714 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 26 states. [2020-07-29 03:26:00,715 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:00,717 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:26:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:26:00,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:00,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:00,718 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states and 33 transitions. [2020-07-29 03:26:00,718 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states and 33 transitions. [2020-07-29 03:26:00,718 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:00,720 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:26:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:26:00,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:00,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:00,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:00,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 03:26:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-07-29 03:26:00,723 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:26:00,723 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:26:00,723 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:26:00,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:26:00,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:00,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:00,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:00,724 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:00,724 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:00,728 INFO L794 eck$LassoCheckResult]: Stem: 1702#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1695#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1696#L532 assume !(main_~length1~0 < 1); 1697#L532-2 assume !(main_~length2~0 < 1); 1690#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 1691#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 1705#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 1706#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 1685#L541-4 main_~i~1 := 0; 1686#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 1692#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 1693#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 1694#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 1687#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 1689#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 1703#L522-5 [2020-07-29 03:26:00,728 INFO L796 eck$LassoCheckResult]: Loop: 1703#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 1698#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 1699#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 1703#L522-5 [2020-07-29 03:26:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2055034687, now seen corresponding path program 1 times [2020-07-29 03:26:00,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:00,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009827573] [2020-07-29 03:26:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:00,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:00,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:00,779 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:00,781 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 2 times [2020-07-29 03:26:00,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:00,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120626318] [2020-07-29 03:26:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:00,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:00,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:00,796 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:00,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:00,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1074579938, now seen corresponding path program 1 times [2020-07-29 03:26:00,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:00,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451767987] [2020-07-29 03:26:00,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:00,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:00,850 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:00,854 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:01,802 WARN L193 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 129 [2020-07-29 03:26:02,157 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-07-29 03:26:02,160 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:02,160 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:02,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:02,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:02,161 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:02,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:02,161 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:02,161 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:02,161 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration10_Lasso [2020-07-29 03:26:02,161 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:02,161 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:02,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:02,905 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2020-07-29 03:26:03,124 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2020-07-29 03:26:03,127 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:03,127 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:03,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:03,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:03,859 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-07-29 03:26:04,466 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-07-29 03:26:04,644 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-07-29 03:26:04,840 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:04,840 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:04,846 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 [2020-07-29 03:26:04,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:04,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:04,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:04,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:04,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:04,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:04,848 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:04,849 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:04,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 [2020-07-29 03:26:04,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:04,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:04,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:04,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:04,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:04,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:04,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:04,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:04,902 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 [2020-07-29 03:26:04,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:04,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:04,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:04,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:04,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:04,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:04,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:04,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:04,932 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 [2020-07-29 03:26:04,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:04,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:04,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:04,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:04,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:04,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:04,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:04,961 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 [2020-07-29 03:26:04,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:04,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:04,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:04,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:04,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:04,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:04,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:04,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:04,988 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 [2020-07-29 03:26:04,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:04,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:04,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:04,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:04,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:04,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:04,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:04,991 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:05,014 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 [2020-07-29 03:26:05,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,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 [2020-07-29 03:26:05,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:05,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,104 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 [2020-07-29 03:26:05,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:05,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:05,110 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,133 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 [2020-07-29 03:26:05,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,158 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 [2020-07-29 03:26:05,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,185 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 [2020-07-29 03:26:05,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,212 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 [2020-07-29 03:26:05,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:05,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:05,220 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,242 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 [2020-07-29 03:26:05,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,268 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 [2020-07-29 03:26:05,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,295 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 [2020-07-29 03:26:05,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,321 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 [2020-07-29 03:26:05,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,347 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 [2020-07-29 03:26:05,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:05,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:05,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,376 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 [2020-07-29 03:26:05,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,403 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 [2020-07-29 03:26:05,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,406 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,428 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 [2020-07-29 03:26:05,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:05,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:05,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:05,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,453 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 [2020-07-29 03:26:05,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:05,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:05,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,482 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 [2020-07-29 03:26:05,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:05,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:05,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:05,523 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 [2020-07-29 03:26:05,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:05,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:05,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,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 [2020-07-29 03:26:05,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:05,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:05,559 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,584 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 [2020-07-29 03:26:05,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,585 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 03:26:05,585 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2020-07-29 03:26:05,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,668 INFO L401 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2020-07-29 03:26:05,668 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2020-07-29 03:26:05,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,896 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 [2020-07-29 03:26:05,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,903 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:05,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:05,918 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:05,942 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 [2020-07-29 03:26:05,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:05,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:05,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:05,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:05,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:05,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:05,989 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:06,148 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2020-07-29 03:26:06,148 INFO L444 ModelExtractionUtils]: 21 out of 58 variables were initially zero. Simplification set additionally 34 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:06,155 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:06,159 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:06,159 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:06,160 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~s~0.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_3) = -1*ULTIMATE.start_cstrspn_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_3 Supporting invariants [] [2020-07-29 03:26:06,431 INFO L297 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2020-07-29 03:26:06,440 INFO L393 LassoCheck]: Loop: "call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5;" "assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256);" "assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset;" [2020-07-29 03:26:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:06,447 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:06,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:06,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:06,612 INFO L280 TraceCheckUtils]: 0: Hoare triple {1844#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1844#unseeded} is VALID [2020-07-29 03:26:06,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {1844#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {1844#unseeded} is VALID [2020-07-29 03:26:06,617 INFO L280 TraceCheckUtils]: 2: Hoare triple {1844#unseeded} assume !(main_~length1~0 < 1); {1844#unseeded} is VALID [2020-07-29 03:26:06,618 INFO L280 TraceCheckUtils]: 3: Hoare triple {1844#unseeded} assume !(main_~length2~0 < 1); {1844#unseeded} is VALID [2020-07-29 03:26:06,619 INFO L280 TraceCheckUtils]: 4: Hoare triple {1844#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,621 INFO L280 TraceCheckUtils]: 6: Hoare triple {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,622 INFO L280 TraceCheckUtils]: 7: Hoare triple {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~0 < main_~length1~0 - 1); {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,623 INFO L280 TraceCheckUtils]: 8: Hoare triple {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_~i~1 := 0; {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,624 INFO L280 TraceCheckUtils]: 10: Hoare triple {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~1 < main_~length2~0 - 1); {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,627 INFO L280 TraceCheckUtils]: 12: Hoare triple {2010#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {2035#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,628 INFO L280 TraceCheckUtils]: 13: Hoare triple {2035#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {2035#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {2035#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {1989#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:06,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:06,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:06,676 INFO L280 TraceCheckUtils]: 0: Hoare triple {1990#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset) (select |#length| ULTIMATE.start_main_~nondetString2~0.base))) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {2042#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {2042#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {2042#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,679 INFO L280 TraceCheckUtils]: 2: Hoare triple {2042#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {1992#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset) (select |#length| ULTIMATE.start_main_~nondetString2~0.base))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:06,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:06,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:06,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:06,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,703 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:26:06,703 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 03:26:06,835 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 51 states and 61 transitions. Complement of second has 7 states. [2020-07-29 03:26:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:06,836 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:06,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 03:26:06,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:06,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:06,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:26:06,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:06,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:06,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:06,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 61 transitions. [2020-07-29 03:26:06,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:06,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:06,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:06,840 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 03:26:06,840 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:06,840 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:26:06,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:06,842 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:06,843 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 61 transitions. cyclomatic complexity: 16 [2020-07-29 03:26:06,843 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:06,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:06,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:06,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:06,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:06,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:06,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:06,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:06,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:06,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:06,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 51 letters. Loop has 51 letters. [2020-07-29 03:26:06,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 51 letters. Loop has 51 letters. [2020-07-29 03:26:06,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 51 letters. Loop has 51 letters. [2020-07-29 03:26:06,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:06,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:06,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:06,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:06,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:06,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:06,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:06,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:06,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:06,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:06,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:06,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:06,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:06,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:06,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:06,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:06,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:06,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:06,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:06,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:06,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:06,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:26:06,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:26:06,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 3 letters. [2020-07-29 03:26:06,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:06,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:06,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 61 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:06,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,864 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:06,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:26:06,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 03:26:06,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:06,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:06,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:26:06,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:06,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 61 transitions. cyclomatic complexity: 16 [2020-07-29 03:26:06,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:06,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 38 states and 46 transitions. [2020-07-29 03:26:06,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:26:06,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:26:06,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2020-07-29 03:26:06,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:06,875 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-07-29 03:26:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2020-07-29 03:26:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2020-07-29 03:26:06,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:06,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 46 transitions. Second operand 32 states. [2020-07-29 03:26:06,888 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 46 transitions. Second operand 32 states. [2020-07-29 03:26:06,888 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 32 states. [2020-07-29 03:26:06,889 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:06,890 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-07-29 03:26:06,891 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-29 03:26:06,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:06,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:06,892 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states and 46 transitions. [2020-07-29 03:26:06,892 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states and 46 transitions. [2020-07-29 03:26:06,893 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:06,895 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2020-07-29 03:26:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-07-29 03:26:06,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:06,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:06,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:06,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 03:26:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-29 03:26:06,897 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-29 03:26:06,897 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-29 03:26:06,897 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 03:26:06,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 39 transitions. [2020-07-29 03:26:06,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:06,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:06,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:06,898 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:06,898 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:06,899 INFO L794 eck$LassoCheckResult]: Stem: 2134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2127#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 2128#L532 assume !(main_~length1~0 < 1); 2129#L532-2 assume !(main_~length2~0 < 1); 2122#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 2123#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 2137#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 2138#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 2116#L541-4 main_~i~1 := 0; 2117#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 2124#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 2125#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 2126#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 2118#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 2119#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 2136#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 2132#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 2133#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; 2112#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 2113#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 2114#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 2115#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 2121#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 2135#L522-5 [2020-07-29 03:26:06,900 INFO L796 eck$LassoCheckResult]: Loop: 2135#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 2130#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 2131#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 2135#L522-5 [2020-07-29 03:26:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1742810479, now seen corresponding path program 2 times [2020-07-29 03:26:06,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:06,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715557875] [2020-07-29 03:26:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:07,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {2316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2316#true} is VALID [2020-07-29 03:26:07,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {2316#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {2316#true} is VALID [2020-07-29 03:26:07,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {2316#true} assume !(main_~length1~0 < 1); {2316#true} is VALID [2020-07-29 03:26:07,261 INFO L280 TraceCheckUtils]: 3: Hoare triple {2316#true} assume !(main_~length2~0 < 1); {2316#true} is VALID [2020-07-29 03:26:07,262 INFO L280 TraceCheckUtils]: 4: Hoare triple {2316#true} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {2318#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:26:07,263 INFO L280 TraceCheckUtils]: 5: Hoare triple {2318#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {2319#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))))} is VALID [2020-07-29 03:26:07,264 INFO L280 TraceCheckUtils]: 6: Hoare triple {2319#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {2320#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (or (and (<= 2 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))))} is VALID [2020-07-29 03:26:07,265 INFO L280 TraceCheckUtils]: 7: Hoare triple {2320#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (or (and (<= 2 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))))} assume !(main_~i~0 < main_~length1~0 - 1); {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:07,265 INFO L280 TraceCheckUtils]: 8: Hoare triple {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_~i~1 := 0; {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:07,266 INFO L280 TraceCheckUtils]: 9: Hoare triple {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:07,270 INFO L280 TraceCheckUtils]: 10: Hoare triple {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:07,271 INFO L280 TraceCheckUtils]: 11: Hoare triple {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~1 < main_~length2~0 - 1); {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:07,272 INFO L280 TraceCheckUtils]: 12: Hoare triple {2321#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} is VALID [2020-07-29 03:26:07,273 INFO L280 TraceCheckUtils]: 13: Hoare triple {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} is VALID [2020-07-29 03:26:07,275 INFO L280 TraceCheckUtils]: 14: Hoare triple {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} is VALID [2020-07-29 03:26:07,275 INFO L280 TraceCheckUtils]: 15: Hoare triple {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} is VALID [2020-07-29 03:26:07,276 INFO L280 TraceCheckUtils]: 16: Hoare triple {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} is VALID [2020-07-29 03:26:07,277 INFO L280 TraceCheckUtils]: 17: Hoare triple {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} is VALID [2020-07-29 03:26:07,278 INFO L280 TraceCheckUtils]: 18: Hoare triple {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} is VALID [2020-07-29 03:26:07,279 INFO L280 TraceCheckUtils]: 19: Hoare triple {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} is VALID [2020-07-29 03:26:07,280 INFO L280 TraceCheckUtils]: 20: Hoare triple {2322#(and (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) 1) 0))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {2323#(and (= 1 ULTIMATE.start_cstrspn_~sc1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset)))} is VALID [2020-07-29 03:26:07,281 INFO L280 TraceCheckUtils]: 21: Hoare triple {2323#(and (= 1 ULTIMATE.start_cstrspn_~sc1~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) ULTIMATE.start_cstrspn_~sc1~0.offset)))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {2324#(= 0 |ULTIMATE.start_cstrspn_#t~mem3|)} is VALID [2020-07-29 03:26:07,282 INFO L280 TraceCheckUtils]: 22: Hoare triple {2324#(= 0 |ULTIMATE.start_cstrspn_#t~mem3|)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {2317#false} is VALID [2020-07-29 03:26:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:07,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715557875] [2020-07-29 03:26:07,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365280308] [2020-07-29 03:26:07,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:07,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:26:07,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:26:07,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-29 03:26:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:07,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:07,427 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:07,427 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 03:26:07,428 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:07,455 INFO L624 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2020-07-29 03:26:07,456 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:07,456 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:24 [2020-07-29 03:26:07,459 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:07,460 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_129|]. (and (= (store (store |v_#length_129| ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_main_~length2~0) |#length|) (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) [2020-07-29 03:26:07,460 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (= 0 ULTIMATE.start_main_~i~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) [2020-07-29 03:26:08,442 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-07-29 03:26:08,562 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-07-29 03:26:08,602 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 03:26:08,610 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 03:26:08,623 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 03:26:08,669 INFO L350 Elim1Store]: treesize reduction 34, result has 22.7 percent of original size [2020-07-29 03:26:08,670 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2020-07-29 03:26:08,670 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:08,697 INFO L350 Elim1Store]: treesize reduction 48, result has 20.0 percent of original size [2020-07-29 03:26:08,698 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 24 [2020-07-29 03:26:08,698 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:08,735 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:08,768 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-07-29 03:26:08,769 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:103, output treesize:85 [2020-07-29 03:26:08,779 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:08,779 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_137|, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString2~0.base]. (let ((.cse2 (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base))) (let ((.cse0 (<= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse1 (select |v_#memory_int_137| ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse3 (<= ULTIMATE.start_cstrspn_~sc1~0.offset ULTIMATE.start_main_~nondetString1~0.offset)) (.cse4 (<= .cse2 2))) (or (and .cse0 (= (store |v_#memory_int_137| ULTIMATE.start_cstrspn_~sc1~0.base (store (store .cse1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)) 0) (+ .cse2 (- 1)) 0)) |#memory_int|) (< 1 ULTIMATE.start_main_~length1~0) .cse3 (<= ULTIMATE.start_main_~length1~0 2) .cse4) (let ((.cse5 (select |#length| ULTIMATE.start_main_~nondetString2~0.base))) (and .cse0 (<= .cse5 2) (= |#memory_int| (let ((.cse6 (store |v_#memory_int_137| ULTIMATE.start_cstrspn_~sc1~0.base (store .cse1 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse2 (- 1)) 0)))) (store .cse6 ULTIMATE.start_main_~nondetString2~0.base (store (select .cse6 ULTIMATE.start_main_~nondetString2~0.base) (+ .cse5 (- 1)) 0)))) .cse3 (< 1 .cse2) .cse4))))) [2020-07-29 03:26:08,780 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~nondetString2~0.base, v_prenex_1, ULTIMATE.start_main_~length1~0]. (let ((.cse1 (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base))) (let ((.cse0 (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse3 (<= .cse1 2))) (or (let ((.cse2 (select |#length| ULTIMATE.start_main_~nondetString2~0.base))) (and (= 0 (select .cse0 (+ ULTIMATE.start_main_~nondetString1~0.offset .cse1 (- 1)))) (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= .cse2 2) (<= ULTIMATE.start_cstrspn_~sc1~0.offset ULTIMATE.start_main_~nondetString1~0.offset) (< 1 .cse1) .cse3 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ .cse2 (- 1)))))) (and (= 0 (select .cse0 (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (<= v_prenex_1 0) (< 1 ULTIMATE.start_main_~length1~0) (= 0 (select .cse0 (+ .cse1 (- 1)))) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) .cse3)))) [2020-07-29 03:26:10,005 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2020-07-29 03:26:10,021 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 03:26:10,070 INFO L624 ElimStorePlain]: treesize reduction 10, result has 80.8 percent of original size [2020-07-29 03:26:10,077 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-29 03:26:10,083 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:10,083 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2020-07-29 03:26:10,084 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:10,098 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:10,164 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:10,164 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:58, output treesize:3 [2020-07-29 03:26:10,167 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:10,168 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_cstrspn_~sc1~0.base, v_prenex_1, ULTIMATE.start_main_~length1~0, ULTIMATE.start_cstrspn_~sc1~0.offset, |#length|]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse1 (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base))) (and (= 0 (select .cse0 (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (= |ULTIMATE.start_cstrspn_#t~mem3| (select .cse0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (= 0 (select .cse0 (+ .cse1 (- 1)))) (<= 1 ULTIMATE.start_cstrspn_~sc1~0.offset) (<= ULTIMATE.start_main_~length1~0 2) (<= ULTIMATE.start_cstrspn_~sc1~0.offset (+ v_prenex_1 1)) (<= v_prenex_1 0) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) .cse1) (<= .cse1 2))) [2020-07-29 03:26:10,168 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |ULTIMATE.start_cstrspn_#t~mem3|) [2020-07-29 03:26:10,168 INFO L280 TraceCheckUtils]: 0: Hoare triple {2316#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2316#true} is VALID [2020-07-29 03:26:10,169 INFO L280 TraceCheckUtils]: 1: Hoare triple {2316#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {2316#true} is VALID [2020-07-29 03:26:10,169 INFO L280 TraceCheckUtils]: 2: Hoare triple {2316#true} assume !(main_~length1~0 < 1); {2316#true} is VALID [2020-07-29 03:26:10,169 INFO L280 TraceCheckUtils]: 3: Hoare triple {2316#true} assume !(main_~length2~0 < 1); {2316#true} is VALID [2020-07-29 03:26:10,171 INFO L280 TraceCheckUtils]: 4: Hoare triple {2316#true} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {2340#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:10,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {2340#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {2344#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:10,172 INFO L280 TraceCheckUtils]: 6: Hoare triple {2344#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 0 ULTIMATE.start_main_~i~0) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {2348#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~i~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:10,174 INFO L280 TraceCheckUtils]: 7: Hoare triple {2348#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~i~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {2352#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:10,175 INFO L280 TraceCheckUtils]: 8: Hoare triple {2352#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {2356#(and (<= ULTIMATE.start_main_~i~1 0) (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:10,175 INFO L280 TraceCheckUtils]: 9: Hoare triple {2356#(and (<= ULTIMATE.start_main_~i~1 0) (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {2356#(and (<= ULTIMATE.start_main_~i~1 0) (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:10,176 INFO L280 TraceCheckUtils]: 10: Hoare triple {2356#(and (<= ULTIMATE.start_main_~i~1 0) (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {2363#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~1 1) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:10,178 INFO L280 TraceCheckUtils]: 11: Hoare triple {2363#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~1 1) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {2367#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (<= ULTIMATE.start_main_~length2~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:10,183 INFO L280 TraceCheckUtils]: 12: Hoare triple {2367#(and (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (< 1 ULTIMATE.start_main_~length1~0) (or (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (<= ULTIMATE.start_main_~length2~0 2) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {2371#(or (and (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset ULTIMATE.start_main_~nondetString1~0.offset))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int)) (and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 2) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (- 1)))))) (< 1 (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2)) (and (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2)))} is VALID [2020-07-29 03:26:10,186 INFO L280 TraceCheckUtils]: 13: Hoare triple {2371#(or (and (exists ((ULTIMATE.start_main_~nondetString1~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= ULTIMATE.start_main_~nondetString1~0.offset 0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset ULTIMATE.start_main_~nondetString1~0.offset))) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int)) (and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) 2) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (- 1)))))) (< 1 (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2)) (and (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2)))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} is VALID [2020-07-29 03:26:10,188 INFO L280 TraceCheckUtils]: 14: Hoare triple {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} is VALID [2020-07-29 03:26:10,191 INFO L280 TraceCheckUtils]: 15: Hoare triple {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} is VALID [2020-07-29 03:26:10,192 INFO L280 TraceCheckUtils]: 16: Hoare triple {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} is VALID [2020-07-29 03:26:10,193 INFO L280 TraceCheckUtils]: 17: Hoare triple {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} is VALID [2020-07-29 03:26:10,194 INFO L280 TraceCheckUtils]: 18: Hoare triple {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} is VALID [2020-07-29 03:26:10,195 INFO L280 TraceCheckUtils]: 19: Hoare triple {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} is VALID [2020-07-29 03:26:10,196 INFO L280 TraceCheckUtils]: 20: Hoare triple {2375#(and (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrspn_~sc1~0.offset v_prenex_1) (<= ULTIMATE.start_main_~length1~0 2) (<= v_prenex_1 0))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {2397#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= 1 ULTIMATE.start_cstrspn_~sc1~0.offset) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (<= ULTIMATE.start_cstrspn_~sc1~0.offset (+ v_prenex_1 1)) (<= v_prenex_1 0))))} is VALID [2020-07-29 03:26:10,198 INFO L280 TraceCheckUtils]: 21: Hoare triple {2397#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) (- 1)))) (<= 1 ULTIMATE.start_cstrspn_~sc1~0.offset) (<= (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base) 2) (exists ((v_prenex_1 Int) (ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ v_prenex_1 ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (<= ULTIMATE.start_cstrspn_~sc1~0.offset (+ v_prenex_1 1)) (<= v_prenex_1 0))))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {2324#(= 0 |ULTIMATE.start_cstrspn_#t~mem3|)} is VALID [2020-07-29 03:26:10,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {2324#(= 0 |ULTIMATE.start_cstrspn_#t~mem3|)} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {2317#false} is VALID [2020-07-29 03:26:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:10,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:10,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2020-07-29 03:26:10,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226827256] [2020-07-29 03:26:10,205 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:10,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:10,206 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 3 times [2020-07-29 03:26:10,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:10,206 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876694207] [2020-07-29 03:26:10,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:10,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:10,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:10,215 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:10,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:10,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-29 03:26:10,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-07-29 03:26:10,335 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. cyclomatic complexity: 12 Second operand 19 states. [2020-07-29 03:26:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:12,756 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-07-29 03:26:12,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-29 03:26:12,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-29 03:26:12,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:12,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2020-07-29 03:26:12,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:12,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 35 states and 42 transitions. [2020-07-29 03:26:12,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 03:26:12,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:26:12,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2020-07-29 03:26:12,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:12,855 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2020-07-29 03:26:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2020-07-29 03:26:12,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-29 03:26:12,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:12,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 42 transitions. Second operand 34 states. [2020-07-29 03:26:12,857 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 42 transitions. Second operand 34 states. [2020-07-29 03:26:12,857 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 34 states. [2020-07-29 03:26:12,858 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:12,859 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-29 03:26:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-29 03:26:12,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:12,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:12,860 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states and 42 transitions. [2020-07-29 03:26:12,860 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states and 42 transitions. [2020-07-29 03:26:12,861 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:12,862 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2020-07-29 03:26:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2020-07-29 03:26:12,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:12,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:12,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:12,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-29 03:26:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2020-07-29 03:26:12,864 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-07-29 03:26:12,864 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2020-07-29 03:26:12,865 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 03:26:12,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2020-07-29 03:26:12,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:12,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:12,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:12,866 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:12,866 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:12,867 INFO L794 eck$LassoCheckResult]: Stem: 2521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2514#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 2515#L532 assume !(main_~length1~0 < 1); 2516#L532-2 assume !(main_~length2~0 < 1); 2509#L535-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 2510#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 2526#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 2527#L541-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 2529#L541-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 2531#L541-3 assume !(main_~i~0 < main_~length1~0 - 1); 2503#L541-4 main_~i~1 := 0; 2504#L546-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 2511#L546-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 2512#L546-3 assume !(main_~i~1 < main_~length2~0 - 1); 2513#L546-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; 2505#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 2506#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 2524#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 2519#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 2520#L522-3 assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; 2499#L522-6 call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); 2500#L524 assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; 2501#L519-3 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; 2502#L519-4 call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); 2508#L519-1 assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; 2522#L522-5 [2020-07-29 03:26:12,867 INFO L796 eck$LassoCheckResult]: Loop: 2522#L522-5 call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; 2517#L522-1 assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); 2518#L522-3 assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; 2522#L522-5 [2020-07-29 03:26:12,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1365761455, now seen corresponding path program 3 times [2020-07-29 03:26:12,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:12,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569218094] [2020-07-29 03:26:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,905 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:12,906 INFO L82 PathProgramCache]: Analyzing trace with hash 86496, now seen corresponding path program 4 times [2020-07-29 03:26:12,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:12,907 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259330888] [2020-07-29 03:26:12,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,914 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:12,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:12,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1174254192, now seen corresponding path program 1 times [2020-07-29 03:26:12,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:12,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862240683] [2020-07-29 03:26:12,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,956 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:14,790 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 228 DAG size of output: 177 [2020-07-29 03:26:19,607 WARN L193 SmtUtils]: Spent 4.61 s on a formula simplification. DAG size of input: 151 DAG size of output: 151 [2020-07-29 03:26:19,614 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:19,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:19,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:19,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:19,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:19,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:19,615 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:19,615 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:19,615 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrspn-alloca-1.i_Iteration12_Lasso [2020-07-29 03:26:19,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:19,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:19,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:19,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:20,601 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2020-07-29 03:26:21,898 WARN L193 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 137 DAG size of output: 114 [2020-07-29 03:26:22,124 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2020-07-29 03:26:22,127 WARN L257 bleTransFormulaUtils]: 6 quantified variables [2020-07-29 03:26:22,127 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:22,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:22,746 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-07-29 03:26:23,161 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2020-07-29 03:26:23,416 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 03:26:24,275 WARN L193 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2020-07-29 03:26:24,603 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-07-29 03:26:24,931 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:24,932 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:24,935 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 [2020-07-29 03:26:24,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:24,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:24,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:24,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:24,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:24,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:24,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:24,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:24,962 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 Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:24,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:24,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:24,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:24,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:24,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:24,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:24,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:24,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:24,987 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 [2020-07-29 03:26:24,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:24,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:24,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:24,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:24,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:24,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:24,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:24,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,014 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 [2020-07-29 03:26:25,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:25,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:25,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,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 [2020-07-29 03:26:25,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:25,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:25,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:25,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:25,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:25,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:25,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:25,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:25,102 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:25,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:25,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:25,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:25,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:25,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:25,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,183 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 [2020-07-29 03:26:25,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:25,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:25,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:25,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,209 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 [2020-07-29 03:26:25,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:25,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:25,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:25,212 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,234 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 [2020-07-29 03:26:25,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:25,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:25,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:25,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:25,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:25,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:25,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:25,370 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-07-29 03:26:25,370 INFO L444 ModelExtractionUtils]: 10 out of 49 variables were initially zero. Simplification set additionally 36 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:25,374 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:25,377 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:25,377 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:25,378 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_4, ULTIMATE.start_cstrspn_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_4 - 1*ULTIMATE.start_cstrspn_~s~0.offset Supporting invariants [] [2020-07-29 03:26:25,749 INFO L297 tatePredicateManager]: 40 out of 42 supporting invariants were superfluous and have been removed [2020-07-29 03:26:25,756 INFO L393 LassoCheck]: Loop: "call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5;" "assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256);" "assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset;" [2020-07-29 03:26:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:25,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {2711#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2711#unseeded} is VALID [2020-07-29 03:26:25,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {2711#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {2711#unseeded} is VALID [2020-07-29 03:26:25,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {2711#unseeded} assume !(main_~length1~0 < 1); {2711#unseeded} is VALID [2020-07-29 03:26:25,909 INFO L280 TraceCheckUtils]: 3: Hoare triple {2711#unseeded} assume !(main_~length2~0 < 1); {2711#unseeded} is VALID [2020-07-29 03:26:25,910 INFO L280 TraceCheckUtils]: 4: Hoare triple {2711#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,911 INFO L280 TraceCheckUtils]: 5: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,912 INFO L280 TraceCheckUtils]: 6: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,912 INFO L280 TraceCheckUtils]: 7: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,913 INFO L280 TraceCheckUtils]: 8: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~0 < main_~length1~0 - 1); {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,914 INFO L280 TraceCheckUtils]: 10: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_~i~1 := 0; {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,915 INFO L280 TraceCheckUtils]: 11: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,915 INFO L280 TraceCheckUtils]: 12: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~1 < main_~length2~0 - 1); {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,917 INFO L280 TraceCheckUtils]: 14: Hoare triple {2957#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,918 INFO L280 TraceCheckUtils]: 15: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,919 INFO L280 TraceCheckUtils]: 16: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,920 INFO L280 TraceCheckUtils]: 17: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,921 INFO L280 TraceCheckUtils]: 18: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,922 INFO L280 TraceCheckUtils]: 19: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,922 INFO L280 TraceCheckUtils]: 20: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,924 INFO L280 TraceCheckUtils]: 21: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,925 INFO L280 TraceCheckUtils]: 22: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,927 INFO L280 TraceCheckUtils]: 23: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,928 INFO L280 TraceCheckUtils]: 24: Hoare triple {2988#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {2936#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:25,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:25,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {3019#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {3019#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {3019#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,985 INFO L280 TraceCheckUtils]: 2: Hoare triple {3019#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {2939#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:25,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:26,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:26,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,015 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:26:26,015 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 03:26:26,155 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 50 states and 58 transitions. Complement of second has 7 states. [2020-07-29 03:26:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:26,155 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:26,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:26,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:26:26,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:26,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2020-07-29 03:26:26,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:26,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,159 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:26,159 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:26,160 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:26:26,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:26,161 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:26,161 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 58 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:26,162 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:26,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:26:26,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:26:26,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:26:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:26:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:26:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:26:26,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:26,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:26,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:26,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,177 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:26:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 03:26:26,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,179 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:26:26,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:26,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:26,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:26,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {2711#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2711#unseeded} is VALID [2020-07-29 03:26:26,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {2711#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {2711#unseeded} is VALID [2020-07-29 03:26:26,336 INFO L280 TraceCheckUtils]: 2: Hoare triple {2711#unseeded} assume !(main_~length1~0 < 1); {2711#unseeded} is VALID [2020-07-29 03:26:26,337 INFO L280 TraceCheckUtils]: 3: Hoare triple {2711#unseeded} assume !(main_~length2~0 < 1); {2711#unseeded} is VALID [2020-07-29 03:26:26,338 INFO L280 TraceCheckUtils]: 4: Hoare triple {2711#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,339 INFO L280 TraceCheckUtils]: 5: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,339 INFO L280 TraceCheckUtils]: 6: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,340 INFO L280 TraceCheckUtils]: 7: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,341 INFO L280 TraceCheckUtils]: 8: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,342 INFO L280 TraceCheckUtils]: 9: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~0 < main_~length1~0 - 1); {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,342 INFO L280 TraceCheckUtils]: 10: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_~i~1 := 0; {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,344 INFO L280 TraceCheckUtils]: 12: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,344 INFO L280 TraceCheckUtils]: 13: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~1 < main_~length2~0 - 1); {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,345 INFO L280 TraceCheckUtils]: 14: Hoare triple {3105#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,346 INFO L280 TraceCheckUtils]: 15: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,347 INFO L280 TraceCheckUtils]: 16: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,347 INFO L280 TraceCheckUtils]: 17: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,349 INFO L280 TraceCheckUtils]: 18: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,349 INFO L280 TraceCheckUtils]: 19: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,351 INFO L280 TraceCheckUtils]: 20: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,351 INFO L280 TraceCheckUtils]: 21: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,352 INFO L280 TraceCheckUtils]: 22: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,353 INFO L280 TraceCheckUtils]: 23: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,355 INFO L280 TraceCheckUtils]: 24: Hoare triple {3136#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {2936#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:26,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:26,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:26,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {3167#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {3167#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {3167#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {3167#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {2939#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:26,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:26,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:26,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,433 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:26:26,433 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 03:26:26,570 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 50 states and 58 transitions. Complement of second has 7 states. [2020-07-29 03:26:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:26,570 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:26,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:26,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:26:26,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:26,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2020-07-29 03:26:26,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:26,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:26,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:26,574 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:26,574 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:26,574 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:26:26,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:26,575 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:26,575 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 58 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:26,575 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:26,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:26:26,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:26:26,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 50 letters. Loop has 50 letters. [2020-07-29 03:26:26,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:26:26,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:26:26,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:26:26,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:26,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:26,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:26,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:26,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:26,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 58 transitions. cyclomatic complexity: 13 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:26,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,589 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:26:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 03:26:26,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,590 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:26:26,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:26,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:26,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:26,745 INFO L280 TraceCheckUtils]: 0: Hoare triple {2711#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2711#unseeded} is VALID [2020-07-29 03:26:26,746 INFO L280 TraceCheckUtils]: 1: Hoare triple {2711#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {2711#unseeded} is VALID [2020-07-29 03:26:26,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {2711#unseeded} assume !(main_~length1~0 < 1); {2711#unseeded} is VALID [2020-07-29 03:26:26,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {2711#unseeded} assume !(main_~length2~0 < 1); {2711#unseeded} is VALID [2020-07-29 03:26:26,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {2711#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,752 INFO L280 TraceCheckUtils]: 5: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~0 < main_~length1~0 - 1); {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,755 INFO L280 TraceCheckUtils]: 10: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_~i~1 := 0; {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,758 INFO L280 TraceCheckUtils]: 13: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~1 < main_~length2~0 - 1); {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,760 INFO L280 TraceCheckUtils]: 14: Hoare triple {3253#(and unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~mem4, cstrspn_#t~post8.base, cstrspn_#t~post8.offset, cstrspn_#t~mem5, cstrspn_#t~mem6, cstrspn_#t~short7, cstrspn_#t~mem9, cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, cstrspn_~s~0.base, cstrspn_~s~0.offset, cstrspn_~c~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;havoc cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;havoc cstrspn_~s~0.base, cstrspn_~s~0.offset;havoc cstrspn_~c~0;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset; {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,761 INFO L280 TraceCheckUtils]: 15: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,762 INFO L280 TraceCheckUtils]: 16: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,763 INFO L280 TraceCheckUtils]: 17: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,765 INFO L280 TraceCheckUtils]: 18: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,766 INFO L280 TraceCheckUtils]: 19: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5; {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,767 INFO L280 TraceCheckUtils]: 20: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem9 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1); {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,768 INFO L280 TraceCheckUtils]: 21: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(cstrspn_#t~mem9 != cstrspn_~c~0);havoc cstrspn_#t~mem9; {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,769 INFO L280 TraceCheckUtils]: 22: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset;cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset; {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,770 INFO L280 TraceCheckUtils]: 23: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem3 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1); {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,773 INFO L280 TraceCheckUtils]: 24: Hoare triple {3284#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~s2.base) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(0 != cstrspn_#t~mem3);havoc cstrspn_#t~mem3;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;call cstrspn_#t~mem4 := read~int(cstrspn_~sc1~0.base, cstrspn_~sc1~0.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem4;havoc cstrspn_#t~mem4; {2936#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:26,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:26,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:26,824 INFO L280 TraceCheckUtils]: 0: Hoare triple {2937#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (>= oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} call cstrspn_#t~mem5 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := 0 != cstrspn_#t~mem5; {3315#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {3315#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume cstrspn_#t~short7;call cstrspn_#t~mem6 := read~int(cstrspn_~s~0.base, cstrspn_~s~0.offset, 1);cstrspn_#t~short7 := cstrspn_#t~mem6 != (if cstrspn_~c~0 % 256 <= 127 then cstrspn_~c~0 % 256 else cstrspn_~c~0 % 256 - 256); {3315#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,828 INFO L280 TraceCheckUtils]: 2: Hoare triple {3315#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_cstrspn_~s~0.offset)) (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!cstrspn_#t~short7;havoc cstrspn_#t~mem6;havoc cstrspn_#t~short7;havoc cstrspn_#t~mem5;cstrspn_#t~post8.base, cstrspn_#t~post8.offset := cstrspn_~s~0.base, cstrspn_~s~0.offset;cstrspn_~s~0.base, cstrspn_~s~0.offset := cstrspn_#t~post8.base, 1 + cstrspn_#t~post8.offset;havoc cstrspn_#t~post8.base, cstrspn_#t~post8.offset; {2939#(and (= ULTIMATE.start_cstrspn_~s~0.base |ULTIMATE.start_main_#t~malloc13.base|) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_cstrspn_~s~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:26,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:26,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:26,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:26,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:26,861 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:26:26,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 03:26:27,000 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 41 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 49 states and 58 transitions. Complement of second has 6 states. [2020-07-29 03:26:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:27,001 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:27,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:27,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:27,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:27,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:26:27,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:27,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:27,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:27,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 58 transitions. [2020-07-29 03:26:27,004 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:27,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:27,004 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 41 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:27,004 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:27,004 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:26:27,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:27,006 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:27,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 58 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:27,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 58 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:27,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:27,006 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:26:27,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:27,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:27,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:27,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:27,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:27,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:27,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:26:27,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:26:27,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 14 Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:26:27,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:26:27,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:26:27,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 14 Stem has 34 letters. Loop has 34 letters. [2020-07-29 03:26:27,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:27,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:27,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:27,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:27,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:27,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 3 letters. [2020-07-29 03:26:27,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:27,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:27,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 3 letters. [2020-07-29 03:26:27,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:27,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:27,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:27,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 41 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:27,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:27,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:27,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,017 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:26:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 03:26:27,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 25 letters. Loop has 3 letters. [2020-07-29 03:26:27,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 28 letters. Loop has 3 letters. [2020-07-29 03:26:27,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 25 letters. Loop has 6 letters. [2020-07-29 03:26:27,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:27,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:27,021 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:27,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2020-07-29 03:26:27,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:26:27,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:26:27,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:26:27,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:27,022 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:27,022 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:27,022 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:27,022 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 03:26:27,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:26:27,023 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:27,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:27,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:26:27 BoogieIcfgContainer [2020-07-29 03:26:27,031 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:26:27,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:26:27,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:26:27,032 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:26:27,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:44" (3/4) ... [2020-07-29 03:26:27,036 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:26:27,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:26:27,039 INFO L168 Benchmark]: Toolchain (without parser) took 44169.83 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 657.5 MB). Free memory was 956.2 MB in the beginning and 1.2 GB in the end (delta: -276.6 MB). Peak memory consumption was 380.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:27,039 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:27,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:27,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.42 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. [2020-07-29 03:26:27,041 INFO L168 Benchmark]: Boogie Preprocessor took 40.93 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. [2020-07-29 03:26:27,041 INFO L168 Benchmark]: RCFGBuilder took 619.66 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:27,042 INFO L168 Benchmark]: BuchiAutomizer took 42684.12 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 529.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -168.0 MB). Peak memory consumption was 361.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:27,042 INFO L168 Benchmark]: Witness Printer took 5.52 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:27,044 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 750.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.42 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. * Boogie Preprocessor took 40.93 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 619.66 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 42684.12 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 529.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -168.0 MB). Peak memory consumption was 361.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.52 ms. Allocated memory is still 1.7 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[nondetString2] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * s and consists of 5 locations. 7 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 42.6s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 34.2s. Construction of modules took 1.4s. Büchi inclusion checks took 6.5s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 31 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 247 SDtfs, 631 SDslu, 571 SDs, 0 SdLazy, 681 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU2 SILI1 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital382 mio100 ax107 hnf98 lsp112 ukn60 mio100 lsp54 div101 bol100 ite100 ukn100 eq179 hnf89 smp83 dnf373 smp60 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 291ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 108 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...